<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.6"/>
<title>SystemSharp: TreeAlgorithms.cs Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="logo.png"/></td>
  <td style="padding-left: 0.5em;">
   <div id="projectname">SystemSharp
   &#160;<span id="projectnumber">0.3</span>
   </div>
   <div id="projectbrief">A system-level modeling framework for designing real-time embedded systems</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.6 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Packages</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('_tree_algorithms_8cs_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Properties</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark">&#160;</span>Events</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">TreeAlgorithms.cs</div>  </div>
</div><!--header-->
<div class="contents">
<a href="_tree_algorithms_8cs.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;</div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="keyword">using</span> System;</div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="keyword">using</span> System.Collections.Generic;</div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="keyword">using</span> System.Diagnostics;</div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="keyword">using</span> System.Diagnostics.Contracts;</div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="keyword">using</span> System.Linq;</div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="keyword">using</span> System.Text;</div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="keyword">using</span> SystemSharp.Collections;</div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="keyword">using</span> SystemSharp.SetAlgorithms;</div>
<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;</div>
<div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="namespace_system_sharp_1_1_tree_algorithms.html">   29</a></span>&#160;<span class="keyword">namespace </span>SystemSharp.TreeAlgorithms</div>
<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;{</div>
<div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">   34</a></span>&#160;    <span class="keyword">public</span> <span class="keyword">enum</span> <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a></div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;    {</div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        NoAccess,</div>
<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004a131fb182a881796e7606ed6da27f1197">ReadOnly</a>,</div>
<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004a53dfe5089ae9e65887cb0215cb0098f5">WriteOnly</a>,</div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004a70a2a84088d405a2e3f1e3accaa16723">ReadWrite</a></div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;    }</div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;</div>
<div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_prop_map_3_01_t_this_00_01_t_value_01_4.html">   47</a></span>&#160;    <span class="keyword">public</span> <span class="keyword">interface </span>IPropMap&lt;TThis, TValue&gt;</div>
<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;    {</div>
<div class="line"><a name="l00054"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_prop_map_3_01_t_this_00_01_t_value_01_4.html#acb93248f21e9bc6ef889c9c7888883e2">   54</a></span>&#160;        TValue <span class="keyword">this</span>[TThis elem] { <span class="keyword">get</span>; set; }</div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;</div>
<div class="line"><a name="l00059"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_prop_map_3_01_t_this_00_01_t_value_01_4.html#a8f1b6aace2a3bdf164b1163f118c4907">   59</a></span>&#160;        <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a> Access { <span class="keyword">get</span>; }</div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;    }</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;</div>
<div class="line"><a name="l00065"></a><span class="lineno"><a class="line" href="namespace_system_sharp_1_1_tree_algorithms.html#a42c198b43d26b1f8b998dd6ce93c8d34">   65</a></span>&#160;    <span class="keyword">public</span> <span class="keyword">enum</span> <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a42c198b43d26b1f8b998dd6ce93c8d34">ENodeType</a></div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;    {</div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;        <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a42c198b43d26b1f8b998dd6ce93c8d34a0a28d1583016cd76f295eb77a6301262">Nonheader</a>,</div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a42c198b43d26b1f8b998dd6ce93c8d34a746efcb480a9b538d33da5f0c9b0003a">Reducible</a>,</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;        <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a42c198b43d26b1f8b998dd6ce93c8d34aad6e7652b1bdfb38783486c2c3d5e806">Self</a>,</div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a42c198b43d26b1f8b998dd6ce93c8d34ad644e0f4ad7080896d6c62fbc22af824">Irreducible</a></div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;    }</div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;</div>
<div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html">   77</a></span>&#160;    <span class="keyword">public</span> <span class="keyword">interface </span>IGraphAdapter&lt;T&gt;</div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;    {</div>
<div class="line"><a name="l00082"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a9a2124ab0e5337b582e323a85c57717a">   82</a></span>&#160;        IPropMap&lt;T, T&gt; Parent { <span class="keyword">get</span>; }</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;</div>
<div class="line"><a name="l00087"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a63b86f277d63fe8789f87b3a6764bb0d">   87</a></span>&#160;        IPropMap&lt;T, T[]&gt; Succs { <span class="keyword">get</span>; }</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;</div>
<div class="line"><a name="l00092"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#ac5094a9569eb65cf9756257b2365fcef">   92</a></span>&#160;        IPropMap&lt;T, T[]&gt; Preds { <span class="keyword">get</span>; }</div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;        </div>
<div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a2fe2209a5c1e9aa6a7047867fe2b14b5">   97</a></span>&#160;        IPropMap&lt;T, List&lt;T&gt;&gt; TempList { <span class="keyword">get</span>; }</div>
<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;</div>
<div class="line"><a name="l00102"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a36f6608b8f6a225983e583641f09162b">  102</a></span>&#160;        IPropMap&lt;T, int&gt; PreOrderIndex { <span class="keyword">get</span>; }</div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;</div>
<div class="line"><a name="l00107"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a6fb81481325ad20deab580399b506b79">  107</a></span>&#160;        IPropMap&lt;T, T&gt; PreOrderLast { <span class="keyword">get</span>; }</div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;</div>
<div class="line"><a name="l00112"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#ab14137488c89459fc9f9e55aa97e5e12">  112</a></span>&#160;        IPropMap&lt;T, int&gt; PostOrderIndex { <span class="keyword">get</span>; }</div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;</div>
<div class="line"><a name="l00117"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a765f8dfd35e901ac787d716f5f444380">  117</a></span>&#160;        IPropMap&lt;T, ENodeType&gt; Type { <span class="keyword">get</span>; }</div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;</div>
<div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#ae5fc9d8317d8a8bebdffd7c31a7ba284">  122</a></span>&#160;        IPropMap&lt;T, HashSet&lt;T&gt;&gt; BackPreds { <span class="keyword">get</span>; }</div>
<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;</div>
<div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#ac9227dcf40dd70b27317216bdc4a0557">  127</a></span>&#160;        IPropMap&lt;T, HashSet&lt;T&gt;&gt; NonBackPreds { <span class="keyword">get</span>; }</div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;</div>
<div class="line"><a name="l00132"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#ac366abdfb293cd9dad2252c4a6302058">  132</a></span>&#160;        IPropMap&lt;T, HashSet&lt;T&gt;&gt; RedBackIn { <span class="keyword">get</span>; }</div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;</div>
<div class="line"><a name="l00137"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a777dbec7591b5e2d8f7cd6e2633c8d1c">  137</a></span>&#160;        IPropMap&lt;T, HashSet&lt;T&gt;&gt; OtherIn { <span class="keyword">get</span>; }</div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;</div>
<div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a96d7608ed8292ff90466c5949d29e6fc">  142</a></span>&#160;        IPropMap&lt;T, T&gt; Header { <span class="keyword">get</span>; }</div>
<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;</div>
<div class="line"><a name="l00147"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a008d85ec9f1de991eb1e2ebfde3aac5c">  147</a></span>&#160;        IPropMap&lt;T, T&gt; IDom { <span class="keyword">get</span>; }</div>
<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;</div>
<div class="line"><a name="l00152"></a><span class="lineno"><a class="line" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a5a072da43a5d2205a1d9b16d4e324469">  152</a></span>&#160;        IPropMap&lt;T, T[]&gt; IDoms { <span class="keyword">get</span>; }</div>
<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;    }</div>
<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;</div>
<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;    <span class="keyword">public</span> delegate TValue <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#ae272cf940377ca4e0094c847c51dedd4">GetterFunc&lt;TThis, TValue&gt;</a>(TThis elem);</div>
<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;    <span class="keyword">public</span> delegate <span class="keywordtype">void</span> <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#afaa417760d7b75df6364c21f071e1027">SetterFunc&lt;TThis, TValue&gt;</a>(TThis elem, TValue value);</div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;</div>
<div class="line"><a name="l00163"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_delegate_prop_map_3_01_t_this_00_01_t_value_01_4.html">  163</a></span>&#160;    <span class="keyword">public</span> <span class="keyword">class </span>DelegatePropMap&lt;TThis, TValue&gt; :</div>
<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;        IPropMap&lt;TThis, TValue&gt;</div>
<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;    {</div>
<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;        <span class="keyword">private</span> <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#ae272cf940377ca4e0094c847c51dedd4">GetterFunc&lt;TThis, TValue&gt;</a> _get;</div>
<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;        <span class="keyword">private</span> <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#afaa417760d7b75df6364c21f071e1027">SetterFunc&lt;TThis, TValue&gt;</a> _set;</div>
<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;</div>
<div class="line"><a name="l00174"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_delegate_prop_map_3_01_t_this_00_01_t_value_01_4.html#a11ca7ecb318f427fdf636d9d29323424">  174</a></span>&#160;        <span class="keyword">public</span> <a class="code" href="class_system_sharp_1_1_tree_algorithms_1_1_delegate_prop_map_3_01_t_this_00_01_t_value_01_4.html#a11ca7ecb318f427fdf636d9d29323424">DelegatePropMap</a>(<a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#ae272cf940377ca4e0094c847c51dedd4">GetterFunc&lt;TThis, TValue&gt;</a> <span class="keyword">get</span>, <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#afaa417760d7b75df6364c21f071e1027">SetterFunc&lt;TThis, TValue&gt;</a> set)</div>
<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;        {</div>
<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;            _get = <span class="keyword">get</span>;</div>
<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;            _set = set;</div>
<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;        }</div>
<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;</div>
<div class="line"><a name="l00184"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_delegate_prop_map_3_01_t_this_00_01_t_value_01_4.html#a887316b1a499c15932fc581dc730ce0a">  184</a></span>&#160;        <span class="keyword">public</span> <a class="code" href="class_system_sharp_1_1_tree_algorithms_1_1_delegate_prop_map_3_01_t_this_00_01_t_value_01_4.html#a887316b1a499c15932fc581dc730ce0a">DelegatePropMap</a>(<a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#ae272cf940377ca4e0094c847c51dedd4">GetterFunc&lt;TThis, TValue&gt;</a> <span class="keyword">get</span>)</div>
<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;        {</div>
<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;            _get = <span class="keyword">get</span>;</div>
<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;        }</div>
<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;</div>
<div class="line"><a name="l00193"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_delegate_prop_map_3_01_t_this_00_01_t_value_01_4.html#acbf5c506677e7d8212b87b93035ba02d">  193</a></span>&#160;        <span class="keyword">public</span> <a class="code" href="class_system_sharp_1_1_tree_algorithms_1_1_delegate_prop_map_3_01_t_this_00_01_t_value_01_4.html#acbf5c506677e7d8212b87b93035ba02d">DelegatePropMap</a>(<a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#afaa417760d7b75df6364c21f071e1027">SetterFunc&lt;TThis, TValue&gt;</a> set)</div>
<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;        {</div>
<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;            _set = set;</div>
<div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;        }</div>
<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;</div>
<div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;<span class="preprocessor">        #region IPropMap&lt;TThis,TValue&gt; Members</span></div>
<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;        <span class="keyword">public</span> TValue <span class="keyword">this</span>[TThis elem]</div>
<div class="line"><a name="l00201"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_delegate_prop_map_3_01_t_this_00_01_t_value_01_4.html#a5c1cc238dbe624463ccae13e74ff1882">  201</a></span>&#160;        {</div>
<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;            <span class="keyword">get</span></div>
<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;            {</div>
<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;                <span class="keywordflow">if</span> (_get == null)</div>
<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;                    <span class="keywordflow">throw</span> <span class="keyword">new</span> AccessViolationException(<span class="stringliteral">&quot;Reading the property is not allowed&quot;</span>);</div>
<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;                <span class="keywordflow">return</span> _get(elem);</div>
<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;            }</div>
<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;            set</div>
<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;            {</div>
<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;                <span class="keywordflow">if</span> (_set == null)</div>
<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;                    <span class="keywordflow">throw</span> <span class="keyword">new</span> AccessViolationException(<span class="stringliteral">&quot;Writing the property is not allowed&quot;</span>);</div>
<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;                _set(elem, value);</div>
<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;            }</div>
<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;        }</div>
<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;</div>
<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;<span class="preprocessor">        #endregion</span></div>
<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;        <span class="keyword">public</span> <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a> Access</div>
<div class="line"><a name="l00219"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_delegate_prop_map_3_01_t_this_00_01_t_value_01_4.html#a90fd19fba72cea21916594c6ed199f76">  219</a></span>&#160;        {</div>
<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;            <span class="keyword">get</span></div>
<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;            {</div>
<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;                <span class="keywordflow">if</span> (_get == null &amp;&amp; _set == null)</div>
<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;                    <span class="keywordflow">return</span> EAccess.NoAccess;</div>
<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (_get == null)</div>
<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;                    <span class="keywordflow">return</span> EAccess.WriteOnly;</div>
<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (_set == null)</div>
<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;                    <span class="keywordflow">return</span> EAccess.ReadOnly;</div>
<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;                <span class="keywordflow">else</span></div>
<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;                    <span class="keywordflow">return</span> EAccess.ReadWrite;</div>
<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;            }</div>
<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;        }</div>
<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;    }</div>
<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;</div>
<div class="line"><a name="l00239"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hash_based_prop_map_3_01_t_this_00_01_t_value_01_4.html">  239</a></span>&#160;    <span class="keyword">public</span> <span class="keyword">class </span>HashBasedPropMap&lt;TThis, TValue&gt; :</div>
<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;        IPropMap&lt;TThis, TValue&gt;</div>
<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;    {</div>
<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;        <span class="keyword">private</span> Dictionary&lt;TThis, TValue&gt; _map = <span class="keyword">new</span> Dictionary&lt;TThis, TValue&gt;();</div>
<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;</div>
<div class="line"><a name="l00247"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hash_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#a5b34d571e076eed81412e62e6485c30d">  247</a></span>&#160;        <span class="keyword">public</span> <a class="code" href="class_system_sharp_1_1_tree_algorithms_1_1_hash_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#a5b34d571e076eed81412e62e6485c30d">HashBasedPropMap</a>()</div>
<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;        {</div>
<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;            Access = EAccess.ReadWrite;</div>
<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;        }</div>
<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;</div>
<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;        <span class="keyword">public</span> TValue <span class="keyword">this</span>[TThis elem]</div>
<div class="line"><a name="l00253"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hash_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#ac48ed92196a91a531ba5fbb2874f8b7c">  253</a></span>&#160;        {</div>
<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;            <span class="keyword">get</span></div>
<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;            {</div>
<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;                TValue result = <span class="keywordflow">default</span>(TValue);</div>
<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;                _map.TryGetValue(elem, out result);</div>
<div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;                <span class="keywordflow">return</span> result;</div>
<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;            }</div>
<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;            set</div>
<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;            {</div>
<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;                _map[elem] = value;</div>
<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;            }</div>
<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;        }</div>
<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;</div>
<div class="line"><a name="l00269"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hash_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#a1f453fd4b409fcad63662cf7a8e6587b">  269</a></span>&#160;        <span class="keyword">public</span> <span class="keywordtype">bool</span> <a class="code" href="class_system_sharp_1_1_tree_algorithms_1_1_hash_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#a1f453fd4b409fcad63662cf7a8e6587b">ContainsKey</a>(TThis key)</div>
<div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;        {</div>
<div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;            <span class="keywordflow">return</span> _map.ContainsKey(key);</div>
<div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;        }</div>
<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;</div>
<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;        <span class="keyword">public</span> IEnumerable&lt;TThis&gt; Keys</div>
<div class="line"><a name="l00278"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hash_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#a04d53a2b02e5424947490ff4de22bea7">  278</a></span>&#160;        {</div>
<div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;            <span class="keyword">get</span> { <span class="keywordflow">return</span> _map.Keys; }</div>
<div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;        }</div>
<div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;</div>
<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;        <span class="keyword">public</span> IEnumerable&lt;TValue&gt; Values</div>
<div class="line"><a name="l00286"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hash_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#a03fe6bfa32ddb59285ace419ef773bd9">  286</a></span>&#160;        {</div>
<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;            <span class="keyword">get</span> { <span class="keywordflow">return</span> _map.Values; }</div>
<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;        }</div>
<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;</div>
<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;        <span class="keyword">public</span> <span class="keywordtype">int</span> Count</div>
<div class="line"><a name="l00294"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hash_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#a4e0505983bd49bf789aeaed4c4f48fd1">  294</a></span>&#160;        {</div>
<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;            <span class="keyword">get</span> { <span class="keywordflow">return</span> _map.Count; }</div>
<div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;        }</div>
<div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;</div>
<div class="line"><a name="l00301"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hash_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#ae0edd3f01e46bac663e8db0d07e048c5">  301</a></span>&#160;        <span class="keyword">public</span> <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a> Access { <span class="keyword">get</span>; set; }</div>
<div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;    }</div>
<div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;</div>
<div class="line"><a name="l00309"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_cache_based_prop_map_3_01_t_this_00_01_t_value_01_4.html">  309</a></span>&#160;    <span class="keyword">public</span> <span class="keyword">class </span>CacheBasedPropMap&lt;TThis, TValue&gt; :</div>
<div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;        IPropMap&lt;TThis, TValue&gt;</div>
<div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;    {</div>
<div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;        <span class="keyword">private</span> CacheDictionary&lt;TThis, TValue&gt; _map;</div>
<div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;</div>
<div class="line"><a name="l00318"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_cache_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#a78860facc8fcc18e60443503b06592fe">  318</a></span>&#160;        <span class="keyword">public</span> <a class="code" href="class_system_sharp_1_1_tree_algorithms_1_1_cache_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#a78860facc8fcc18e60443503b06592fe">CacheBasedPropMap</a>(Func&lt;TThis, TValue&gt; creator)</div>
<div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;        {</div>
<div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;            _map = <span class="keyword">new</span> CacheDictionary&lt;TThis, TValue&gt;(creator);</div>
<div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;        }</div>
<div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;</div>
<div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;        <span class="keyword">public</span> TValue <span class="keyword">this</span>[TThis elem]</div>
<div class="line"><a name="l00324"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_cache_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#a5208bbdafc01284cd916c07fbe87bf2f">  324</a></span>&#160;        {</div>
<div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;            <span class="keyword">get</span></div>
<div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;            {</div>
<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;                <span class="keywordflow">return</span> _map[elem];</div>
<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;            }</div>
<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;            set</div>
<div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;            {</div>
<div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;                <span class="keywordflow">throw</span> <span class="keyword">new</span> AccessViolationException(<span class="stringliteral">&quot;Writing to CacheBasedPropMap is not allowed&quot;</span>);</div>
<div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;            }</div>
<div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;        }</div>
<div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;</div>
<div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;        <span class="keyword">public</span> IEnumerable&lt;TThis&gt; Keys</div>
<div class="line"><a name="l00339"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_cache_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#a171bb38bb9199f1af49565526c395ffd">  339</a></span>&#160;        {</div>
<div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;            <span class="keyword">get</span> { <span class="keywordflow">return</span> _map.Keys; }</div>
<div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;        }</div>
<div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;</div>
<div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;        <span class="keyword">public</span> IEnumerable&lt;TValue&gt; Values</div>
<div class="line"><a name="l00347"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_cache_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#aff3334b29fa45f098a7606750dce1ca8">  347</a></span>&#160;        {</div>
<div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;            <span class="keyword">get</span> { <span class="keywordflow">return</span> _map.Values; }</div>
<div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;        }</div>
<div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;</div>
<div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;        <span class="keyword">public</span> <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a> Access</div>
<div class="line"><a name="l00355"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_cache_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#a5bfa939a0d2610f4b5a05d339e26bc5f">  355</a></span>&#160;        {</div>
<div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;            <span class="keyword">get</span> { <span class="keywordflow">return</span> EAccess.ReadOnly; }</div>
<div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;        }</div>
<div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;    }</div>
<div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;</div>
<div class="line"><a name="l00365"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_array_backed_prop_map_3_01_t_key_00_01_t_value_01_4.html">  365</a></span>&#160;    <span class="keyword">public</span> <span class="keyword">class </span>ArrayBackedPropMap&lt;TKey, TValue&gt; :</div>
<div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;        IPropMap&lt;TKey, TValue&gt;</div>
<div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;    {</div>
<div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;        <span class="keyword">private</span> TValue[] _back;</div>
<div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160;        <span class="keyword">private</span> Func&lt;TKey, int&gt; _indexFunc;</div>
<div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;</div>
<div class="line"><a name="l00377"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_array_backed_prop_map_3_01_t_key_00_01_t_value_01_4.html#abfcf1dfec4ce1d80a9f9aae6a1ca5b2c">  377</a></span>&#160;        <span class="keyword">public</span> <a class="code" href="class_system_sharp_1_1_tree_algorithms_1_1_array_backed_prop_map_3_01_t_key_00_01_t_value_01_4.html#abfcf1dfec4ce1d80a9f9aae6a1ca5b2c">ArrayBackedPropMap</a>(TValue[] back, Func&lt;TKey, int&gt; indexFunc, <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a> access = <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a>.ReadWrite)</div>
<div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;        {</div>
<div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;            _back = back;</div>
<div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;            _indexFunc = indexFunc;</div>
<div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;            Access = access;</div>
<div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;        }</div>
<div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;</div>
<div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;        <span class="keyword">public</span> TValue <span class="keyword">this</span>[TKey elem]</div>
<div class="line"><a name="l00385"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_array_backed_prop_map_3_01_t_key_00_01_t_value_01_4.html#a9ace1310269d50f617a246940dcdab8d">  385</a></span>&#160;        {</div>
<div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;            <span class="keyword">get</span></div>
<div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;            {</div>
<div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;                <span class="keywordflow">if</span> (Access == <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a>.WriteOnly || Access == <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a>.NoAccess)</div>
<div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;                    <span class="keywordflow">throw</span> <span class="keyword">new</span> AccessViolationException(<span class="stringliteral">&quot;Read access not allowed&quot;</span>);</div>
<div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;                <span class="keywordflow">return</span> _back[_indexFunc(elem)];</div>
<div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;            }</div>
<div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;            set</div>
<div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;            {</div>
<div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;                <span class="keywordflow">if</span> (Access == <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a>.ReadOnly || Access == <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a>.NoAccess)</div>
<div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;                    <span class="keywordflow">throw</span> <span class="keyword">new</span> AccessViolationException(<span class="stringliteral">&quot;Write access not allowed&quot;</span>);</div>
<div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;                _back[_indexFunc(elem)] = value;</div>
<div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;            }</div>
<div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;        }</div>
<div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;</div>
<div class="line"><a name="l00400"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_array_backed_prop_map_3_01_t_key_00_01_t_value_01_4.html#ab02ccc32606bce38d8ff51dd85d5597f">  400</a></span>&#160;        <span class="keyword">public</span> <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a> Access { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;    }</div>
<div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;</div>
<div class="line"><a name="l00406"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_prop_maps.html">  406</a></span>&#160;    <span class="keyword">public</span> <span class="keyword">static</span> <span class="keyword">class </span><a class="code" href="class_system_sharp_1_1_tree_algorithms_1_1_prop_maps.html">PropMaps</a></div>
<div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160;    {</div>
<div class="line"><a name="l00416"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_prop_maps.html#a0fd680fcce24fa6cf629fde526ea8526">  416</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> IPropMap&lt;TKey, TValue&gt; CreateForArray&lt;TKey, TValue&gt;(</div>
<div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;            TValue[] array, Func&lt;TKey, int&gt; indexFunc, <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a> access = EAccess.ReadWrite)</div>
<div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;        {</div>
<div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;            <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code" href="class_system_sharp_1_1_tree_algorithms_1_1_array_backed_prop_map_3_01_t_key_00_01_t_value_01_4.html">ArrayBackedPropMap&lt;TKey, TValue&gt;</a>(array, indexFunc, access);</div>
<div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;        }</div>
<div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;</div>
<div class="line"><a name="l00428"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_prop_maps.html#a3fcb73d60da0483ed3ea2617f6a783a7">  428</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> IPropMap&lt;int, TValue&gt; CreateForArray&lt;TValue&gt;(TValue[] array, <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a> access)</div>
<div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;        {</div>
<div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;            <span class="keywordflow">return</span> <span class="keyword">new</span> ArrayBackedPropMap&lt;int, TValue&gt;(array, i =&gt; i, access);</div>
<div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;        }</div>
<div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;    }</div>
<div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;</div>
<div class="line"><a name="l00438"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html">  438</a></span>&#160;    <span class="keyword">public</span> <span class="keyword">class </span>DefaultTreeAdapter&lt;T&gt; :</div>
<div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160;        IGraphAdapter&lt;T&gt;</div>
<div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;    {</div>
<div class="line"><a name="l00473"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#a7e1e0a8b9f16e98615e0d54d88988647">  473</a></span>&#160;        <span class="keyword">public</span> <a class="code" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#a7e1e0a8b9f16e98615e0d54d88988647">DefaultTreeAdapter</a>(GetterFunc&lt;T,T&gt; getParent,</div>
<div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;            GetterFunc&lt;T,T[]&gt; getChildren,</div>
<div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;            SetterFunc&lt;T,T[]&gt; setChildren,</div>
<div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;            GetterFunc&lt;T, T[]&gt; getPreds,</div>
<div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;            SetterFunc&lt;T, T[]&gt; setPreds,</div>
<div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;            GetterFunc&lt;T,List&lt;T&gt;&gt; getTempList,</div>
<div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;            SetterFunc&lt;T,List&lt;T&gt;&gt; setTempList,</div>
<div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;            GetterFunc&lt;T,int&gt; getPreOrderIndex,</div>
<div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;            SetterFunc&lt;T,int&gt; setPreOrderIndex,</div>
<div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;            GetterFunc&lt;T,T&gt; getPreOrderLast,</div>
<div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;            SetterFunc&lt;T,T&gt; setPreOrderLast,</div>
<div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;            GetterFunc&lt;T, int&gt; getPostOrderIndex,</div>
<div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;            SetterFunc&lt;T, int&gt; setPostOrderIndex,</div>
<div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;            GetterFunc&lt;T, ENodeType&gt; getType,</div>
<div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;            SetterFunc&lt;T,ENodeType&gt; setType,</div>
<div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;            GetterFunc&lt;T,HashSet&lt;T&gt;&gt; getBackPreds,</div>
<div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;            SetterFunc&lt;T,HashSet&lt;T&gt;&gt; setBackPreds,</div>
<div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;            GetterFunc&lt;T,HashSet&lt;T&gt;&gt; getNonBackPreds,</div>
<div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;            SetterFunc&lt;T,HashSet&lt;T&gt;&gt; setNonBackPreds,</div>
<div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;            GetterFunc&lt;T, HashSet&lt;T&gt;&gt; getRedBackIn,</div>
<div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;            SetterFunc&lt;T, HashSet&lt;T&gt;&gt; setRedBackIn,</div>
<div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;            GetterFunc&lt;T, HashSet&lt;T&gt;&gt; getOtherIn,</div>
<div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;            SetterFunc&lt;T, HashSet&lt;T&gt;&gt; setOtherIn,</div>
<div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;            GetterFunc&lt;T, T&gt; getHeader,</div>
<div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;            SetterFunc&lt;T,T&gt; setHeader,</div>
<div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;            GetterFunc&lt;T,T&gt; getIDom,</div>
<div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;            SetterFunc&lt;T,T&gt; setIDom,</div>
<div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;            GetterFunc&lt;T,T[]&gt; getIDoms,</div>
<div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;            SetterFunc&lt;T,T[]&gt; setIDoms</div>
<div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;            )</div>
<div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;        {</div>
<div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;            Parent = <span class="keyword">new</span> DelegatePropMap&lt;T, T&gt;(getParent);</div>
<div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;            Succs = <span class="keyword">new</span> DelegatePropMap&lt;T, T[]&gt;(getChildren, setChildren);</div>
<div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;            Preds = <span class="keyword">new</span> DelegatePropMap&lt;T, T[]&gt;(getPreds, setPreds);</div>
<div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;            TempList = <span class="keyword">new</span> DelegatePropMap&lt;T, List&lt;T&gt;&gt;(getTempList, setTempList);</div>
<div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;            PreOrderIndex = <span class="keyword">new</span> DelegatePropMap&lt;T, int&gt;(getPreOrderIndex, setPreOrderIndex);</div>
<div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;            PreOrderLast = <span class="keyword">new</span> DelegatePropMap&lt;T, T&gt;(getPreOrderLast, setPreOrderLast);</div>
<div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;            PostOrderIndex = <span class="keyword">new</span> DelegatePropMap&lt;T, int&gt;(getPostOrderIndex, setPostOrderIndex);</div>
<div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;            Type = <span class="keyword">new</span> DelegatePropMap&lt;T, ENodeType&gt;(getType, setType);</div>
<div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;            BackPreds = <span class="keyword">new</span> DelegatePropMap&lt;T, HashSet&lt;T&gt;&gt;(getBackPreds, setBackPreds);</div>
<div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;            NonBackPreds = <span class="keyword">new</span> DelegatePropMap&lt;T, HashSet&lt;T&gt;&gt;(getNonBackPreds, setNonBackPreds);</div>
<div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;            RedBackIn = <span class="keyword">new</span> DelegatePropMap&lt;T, HashSet&lt;T&gt;&gt;(getRedBackIn, setRedBackIn);</div>
<div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160;            OtherIn = <span class="keyword">new</span> DelegatePropMap&lt;T, HashSet&lt;T&gt;&gt;(getOtherIn, setOtherIn);</div>
<div class="line"><a name="l00516"></a><span class="lineno">  516</span>&#160;            Header = <span class="keyword">new</span> DelegatePropMap&lt;T, T&gt;(getHeader, setHeader);</div>
<div class="line"><a name="l00517"></a><span class="lineno">  517</span>&#160;            IDom = <span class="keyword">new</span> DelegatePropMap&lt;T, T&gt;(getIDom, setIDom);</div>
<div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160;            IDoms = <span class="keyword">new</span> DelegatePropMap&lt;T, T[]&gt;(getIDoms, setIDoms);</div>
<div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;        }</div>
<div class="line"><a name="l00520"></a><span class="lineno">  520</span>&#160;</div>
<div class="line"><a name="l00521"></a><span class="lineno">  521</span>&#160;<span class="preprocessor">        #region ITreeAdapter&lt;T&gt; Members</span></div>
<div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00523"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#aa8084d1aafa315b3f3a0a8fc96f60eb6">  523</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T&gt; Parent { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00524"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#a46fc4e1ee12058592103a8d0613d65f8">  524</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T[]&gt; Succs { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00525"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#ab625b23fa24cf5894e32ccb9db804699">  525</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T[]&gt; Preds { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00526"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#aca8174385cc43790b65902c8bf76f16f">  526</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, List&lt;T&gt;&gt; TempList { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00527"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#a6fa47139fcba0a640d5d9e08d7ebeeaa">  527</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, int&gt; PreOrderIndex { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00528"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#aa06e3e6ef46f1337215ec309e494448f">  528</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T&gt; PreOrderLast { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00529"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#a58f78561231fc4fc6db194a0886a28b0">  529</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, int&gt; PostOrderIndex { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00530"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#a90962f8fa56ca4bc208db51cdde8833d">  530</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, ENodeType&gt; Type { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00531"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#ac77f439c39639d4603cabd3d3c6b5906">  531</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, HashSet&lt;T&gt;&gt; BackPreds { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00532"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#a54b7afc94eb1c6118ef4b9231053e6e2">  532</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, HashSet&lt;T&gt;&gt; NonBackPreds { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00533"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#aa129730cd025e736965c39aa4c81440a">  533</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, HashSet&lt;T&gt;&gt; RedBackIn { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00534"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#ab2cc007cbb62d03210617ea0ead7e668">  534</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, HashSet&lt;T&gt;&gt; OtherIn { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00535"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#a0cb8fde8188cb9129c041a5bda0c592a">  535</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T&gt; Header { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00536"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#a441380211df8f57d1fe23aba893b9c7b">  536</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T&gt; IDom { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160;        <span class="comment">//public IPropMap&lt;T, T&gt; IPDom { get; private set; }</span></div>
<div class="line"><a name="l00538"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#a73b84027cba96cc3ae6d2bea898b31e0">  538</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T[]&gt; IDoms { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00539"></a><span class="lineno">  539</span>&#160;        <span class="comment">//public IPropMap&lt;T, T[]&gt; IPDoms { get; private set; }</span></div>
<div class="line"><a name="l00540"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#a541cfe61b47642b3745497a193f5e2c7">  540</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, int&gt; IDomPreOrderIndex { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00541"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#a61cea42541b4a690061f25574c37e8a8">  541</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T&gt; IDomPreOrderLast { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00542"></a><span class="lineno">  542</span>&#160;</div>
<div class="line"><a name="l00543"></a><span class="lineno">  543</span>&#160;<span class="preprocessor">        #endregion</span></div>
<div class="line"><a name="l00544"></a><span class="lineno">  544</span>&#160;<span class="preprocessor"></span>    }</div>
<div class="line"><a name="l00545"></a><span class="lineno">  545</span>&#160;</div>
<div class="line"><a name="l00550"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html">  550</a></span>&#160;    <span class="keyword">public</span> <span class="keyword">class </span>HashingGraphAdapter&lt;T&gt; :</div>
<div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;        IGraphAdapter&lt;T&gt;</div>
<div class="line"><a name="l00552"></a><span class="lineno">  552</span>&#160;    {</div>
<div class="line"><a name="l00556"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#a2319fbfb586a0e1a168a6383f07672cb">  556</a></span>&#160;        <span class="keyword">public</span> <a class="code" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#a2319fbfb586a0e1a168a6383f07672cb">HashingGraphAdapter</a>()</div>
<div class="line"><a name="l00557"></a><span class="lineno">  557</span>&#160;        {</div>
<div class="line"><a name="l00558"></a><span class="lineno">  558</span>&#160;            Parent = <span class="keyword">new</span> HashBasedPropMap&lt;T, T&gt;();</div>
<div class="line"><a name="l00559"></a><span class="lineno">  559</span>&#160;            Succs = <span class="keyword">new</span> HashBasedPropMap&lt;T, T[]&gt;();</div>
<div class="line"><a name="l00560"></a><span class="lineno">  560</span>&#160;            Preds = <span class="keyword">new</span> HashBasedPropMap&lt;T, T[]&gt;();</div>
<div class="line"><a name="l00561"></a><span class="lineno">  561</span>&#160;            TempList = <span class="keyword">new</span> HashBasedPropMap&lt;T, List&lt;T&gt;&gt;();</div>
<div class="line"><a name="l00562"></a><span class="lineno">  562</span>&#160;            PreOrderIndex = <span class="keyword">new</span> HashBasedPropMap&lt;T, int&gt;();</div>
<div class="line"><a name="l00563"></a><span class="lineno">  563</span>&#160;            PreOrderLast = <span class="keyword">new</span> HashBasedPropMap&lt;T, T&gt;();</div>
<div class="line"><a name="l00564"></a><span class="lineno">  564</span>&#160;            PostOrderIndex = <span class="keyword">new</span> HashBasedPropMap&lt;T, int&gt;();</div>
<div class="line"><a name="l00565"></a><span class="lineno">  565</span>&#160;            Type = <span class="keyword">new</span> HashBasedPropMap&lt;T, ENodeType&gt;();</div>
<div class="line"><a name="l00566"></a><span class="lineno">  566</span>&#160;            BackPreds = <span class="keyword">new</span> HashBasedPropMap&lt;T, HashSet&lt;T&gt;&gt;();</div>
<div class="line"><a name="l00567"></a><span class="lineno">  567</span>&#160;            NonBackPreds = <span class="keyword">new</span> HashBasedPropMap&lt;T, HashSet&lt;T&gt;&gt;();</div>
<div class="line"><a name="l00568"></a><span class="lineno">  568</span>&#160;            RedBackIn = <span class="keyword">new</span> HashBasedPropMap&lt;T, HashSet&lt;T&gt;&gt;();</div>
<div class="line"><a name="l00569"></a><span class="lineno">  569</span>&#160;            OtherIn = <span class="keyword">new</span> HashBasedPropMap&lt;T, HashSet&lt;T&gt;&gt;();</div>
<div class="line"><a name="l00570"></a><span class="lineno">  570</span>&#160;            Header = <span class="keyword">new</span> HashBasedPropMap&lt;T, T&gt;();</div>
<div class="line"><a name="l00571"></a><span class="lineno">  571</span>&#160;            IDom = <span class="keyword">new</span> HashBasedPropMap&lt;T, T&gt;();</div>
<div class="line"><a name="l00572"></a><span class="lineno">  572</span>&#160;            IPDom = <span class="keyword">new</span> HashBasedPropMap&lt;T, T&gt;();</div>
<div class="line"><a name="l00573"></a><span class="lineno">  573</span>&#160;            IDoms = <span class="keyword">new</span> HashBasedPropMap&lt;T, T[]&gt;();</div>
<div class="line"><a name="l00574"></a><span class="lineno">  574</span>&#160;            IPDoms = <span class="keyword">new</span> HashBasedPropMap&lt;T, T[]&gt;();</div>
<div class="line"><a name="l00575"></a><span class="lineno">  575</span>&#160;        }</div>
<div class="line"><a name="l00576"></a><span class="lineno">  576</span>&#160;</div>
<div class="line"><a name="l00577"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#a28a91439cea7f0d861bf2773772b3cb7">  577</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T&gt; Parent { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00578"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#adeb50505060f4f0cb7429b909e493297">  578</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T[]&gt; Succs  { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00579"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#a2d38693c3aacb97e66074da0dadc36ac">  579</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T[]&gt; Preds  { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00580"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#af9920639f4f3c6b5e7c917c965596386">  580</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, List&lt;T&gt;&gt; TempList  { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00581"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#a443a2a535cf5ee45a61040a70eb553ac">  581</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, int&gt; PreOrderIndex  { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00582"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#a9bf4706f189e557c1c61c583f3236162">  582</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T&gt; PreOrderLast  { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00583"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#ae1b945df4ed3f7098bc158b91996edf6">  583</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, int&gt; PostOrderIndex  { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00584"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#a3bb11d511a0ec7bd636b28717f415899">  584</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, ENodeType&gt; Type  { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00585"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#aa8069665ec475291f91f6e464168516b">  585</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, HashSet&lt;T&gt;&gt; BackPreds  { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00586"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#ab68f473d163616c03b9bea023f4d60d9">  586</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, HashSet&lt;T&gt;&gt; NonBackPreds  { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00587"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#a627fb7b558e6aecd296f7700b7cb754f">  587</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, HashSet&lt;T&gt;&gt; RedBackIn { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00588"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#a245e4642af35d179afdaf6b9de6a71cb">  588</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, HashSet&lt;T&gt;&gt; OtherIn { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00589"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#a86bd4d55d1daea5346bd1a290d6c870a">  589</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T&gt; Header { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00590"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#a6828b24cd313849a78ba735326b517a0">  590</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T&gt; IDom  { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00591"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#afac86a0c3774c2a9e18c9370daa49383">  591</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T&gt; IPDom  { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00592"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#a9ac98c97e51d9300134f3d8c3ff743b2">  592</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T[]&gt; IDoms  { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00593"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#a0f35c3bbe9e70a80952d374ea967e393">  593</a></span>&#160;        <span class="keyword">public</span> IPropMap&lt;T, T[]&gt; IPDoms  { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;    }</div>
<div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;</div>
<div class="line"><a name="l00599"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html">  599</a></span>&#160;    <span class="keyword">public</span> <span class="keyword">static</span> <span class="keyword">class </span><a class="code" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html">TreeOperations</a></div>
<div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;    {</div>
<div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;        <span class="keyword">private</span> <span class="keyword">class </span>PreOrderSetAdapter&lt;T&gt; :</div>
<div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;            ISetAdapter&lt;T&gt;</div>
<div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;        {</div>
<div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;            <span class="keyword">public</span> PreOrderSetAdapter(<a class="code" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html">IGraphAdapter&lt;T&gt;</a> a)</div>
<div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;            {</div>
<div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;                Contract.Requires&lt;ArgumentNullException&gt;(a != null);</div>
<div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;</div>
<div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160;                Index = a.PreOrderIndex;</div>
<div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;            }</div>
<div class="line"><a name="l00610"></a><span class="lineno">  610</span>&#160;</div>
<div class="line"><a name="l00611"></a><span class="lineno">  611</span>&#160;<span class="preprocessor">            #region ISetAdapter&lt;T&gt; Members</span></div>
<div class="line"><a name="l00612"></a><span class="lineno">  612</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00613"></a><span class="lineno">  613</span>&#160;            <span class="keyword">public</span> IPropMap&lt;T, int&gt; Index { <span class="keyword">get</span>; <span class="keyword">private</span> set; }</div>
<div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160;</div>
<div class="line"><a name="l00615"></a><span class="lineno">  615</span>&#160;<span class="preprocessor">            #endregion</span></div>
<div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;<span class="preprocessor"></span>        }</div>
<div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160;</div>
<div class="line"><a name="l00623"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#ae7b3939ad3b687dd82d33190475e8371">  623</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">void</span> RequireAccess&lt;TThis, TValue&gt;(<span class="keyword">this</span> <a class="code" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_prop_map_3_01_t_this_00_01_t_value_01_4.html">IPropMap&lt;TThis, TValue&gt;</a> pmap, <a class="code" href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">EAccess</a> access)</div>
<div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;        {</div>
<div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;            <span class="keywordtype">bool</span> granted;</div>
<div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160;            <span class="keywordflow">switch</span> (pmap.Access)</div>
<div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;            {</div>
<div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;                <span class="keywordflow">case</span> EAccess.NoAccess:</div>
<div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;                    granted = access == EAccess.NoAccess;</div>
<div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;                    <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;</div>
<div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160;                <span class="keywordflow">case</span> EAccess.ReadOnly:</div>
<div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;                    granted = access == EAccess.NoAccess || access == EAccess.ReadOnly;</div>
<div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;                    <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;</div>
<div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160;                <span class="keywordflow">case</span> EAccess.WriteOnly:</div>
<div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160;                    granted = access == EAccess.NoAccess || access == EAccess.WriteOnly;</div>
<div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;                    <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;</div>
<div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;                <span class="keywordflow">case</span> EAccess.ReadWrite:</div>
<div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;                    granted = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160;                    <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;</div>
<div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;                <span class="keywordflow">default</span>:</div>
<div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160;                    <span class="keywordflow">throw</span> <span class="keyword">new</span> NotImplementedException();</div>
<div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160;            }</div>
<div class="line"><a name="l00647"></a><span class="lineno">  647</span>&#160;            <span class="keywordflow">if</span> (!granted)</div>
<div class="line"><a name="l00648"></a><span class="lineno">  648</span>&#160;            {</div>
<div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;                <span class="keywordflow">throw</span> <span class="keyword">new</span> InvalidOperationException(<span class="stringliteral">&quot;Need &quot;</span> + access.ToString() + </div>
<div class="line"><a name="l00650"></a><span class="lineno">  650</span>&#160;                    <span class="stringliteral">&quot; access to a property map, but got only &quot;</span> + pmap.Access.ToString() + <span class="stringliteral">&quot; access&quot;</span>);</div>
<div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160;            }</div>
<div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;        }</div>
<div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;</div>
<div class="line"><a name="l00660"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a1eadc8c2956caf39c9221edfe2dcac07">  660</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">void</span> Reset&lt;TThis, TValue&gt;(<span class="keyword">this</span> <a class="code" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_prop_map_3_01_t_this_00_01_t_value_01_4.html">IPropMap&lt;TThis, TValue&gt;</a> pmap,</div>
<div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;            IEnumerable&lt;TThis&gt; nodes, TValue value)</div>
<div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;        {</div>
<div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;            pmap.RequireAccess(EAccess.WriteOnly);</div>
<div class="line"><a name="l00664"></a><span class="lineno">  664</span>&#160;            <span class="keywordflow">foreach</span> (TThis node <span class="keywordflow">in</span> nodes)</div>
<div class="line"><a name="l00665"></a><span class="lineno">  665</span>&#160;            {</div>
<div class="line"><a name="l00666"></a><span class="lineno">  666</span>&#160;                pmap[node] = value;</div>
<div class="line"><a name="l00667"></a><span class="lineno">  667</span>&#160;            }</div>
<div class="line"><a name="l00668"></a><span class="lineno">  668</span>&#160;        }</div>
<div class="line"><a name="l00669"></a><span class="lineno">  669</span>&#160;</div>
<div class="line"><a name="l00675"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#ae27da9f599c50814e87c355e90455706">  675</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">void</span> Clear&lt;TThis, TValue&gt;(<span class="keyword">this</span> <a class="code" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_prop_map_3_01_t_this_00_01_t_value_01_4.html">IPropMap&lt;TThis, TValue&gt;</a> pmap,</div>
<div class="line"><a name="l00676"></a><span class="lineno">  676</span>&#160;            IEnumerable&lt;TThis&gt; nodes)</div>
<div class="line"><a name="l00677"></a><span class="lineno">  677</span>&#160;        {</div>
<div class="line"><a name="l00678"></a><span class="lineno">  678</span>&#160;            pmap.Reset(nodes, <span class="keywordflow">default</span>(TValue));</div>
<div class="line"><a name="l00679"></a><span class="lineno">  679</span>&#160;        }</div>
<div class="line"><a name="l00680"></a><span class="lineno">  680</span>&#160;</div>
<div class="line"><a name="l00686"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a2e624bf3a57ed8622a59cbf5af429c42">  686</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">void</span> CreateDefaultTempStorage&lt;T&gt;(<span class="keyword">this</span> <a class="code" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html">IGraphAdapter&lt;T&gt;</a> a, IEnumerable&lt;T&gt; nodes)</div>
<div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;        {</div>
<div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160;            a.TempList.RequireAccess(EAccess.WriteOnly);</div>
<div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160;            <span class="keywordflow">foreach</span> (T node <span class="keywordflow">in</span> nodes)</div>
<div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;            {</div>
<div class="line"><a name="l00691"></a><span class="lineno">  691</span>&#160;                a.TempList[node] = <span class="keyword">new</span> List&lt;T&gt;();</div>
<div class="line"><a name="l00692"></a><span class="lineno">  692</span>&#160;            }</div>
<div class="line"><a name="l00693"></a><span class="lineno">  693</span>&#160;        }</div>
<div class="line"><a name="l00694"></a><span class="lineno">  694</span>&#160;</div>
<div class="line"><a name="l00702"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a264e50c23ab43bc5980e80dd9d129d83">  702</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">void</span> InvertRelation&lt;T&gt;(<span class="keyword">this</span> <a class="code" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html">IGraphAdapter&lt;T&gt;</a> a, </div>
<div class="line"><a name="l00703"></a><span class="lineno">  703</span>&#160;            IPropMap&lt;T,T&gt; srcrel, IPropMap&lt;T,T[]&gt; dstrel, IEnumerable&lt;T&gt; nodes)</div>
<div class="line"><a name="l00704"></a><span class="lineno">  704</span>&#160;        {</div>
<div class="line"><a name="l00705"></a><span class="lineno">  705</span>&#160;            a.CreateDefaultTempStorage(nodes);</div>
<div class="line"><a name="l00706"></a><span class="lineno">  706</span>&#160;            srcrel.RequireAccess(EAccess.ReadOnly);</div>
<div class="line"><a name="l00707"></a><span class="lineno">  707</span>&#160;            dstrel.RequireAccess(EAccess.WriteOnly);</div>
<div class="line"><a name="l00708"></a><span class="lineno">  708</span>&#160;            <span class="keywordflow">foreach</span> (T node <span class="keywordflow">in</span> nodes)</div>
<div class="line"><a name="l00709"></a><span class="lineno">  709</span>&#160;            {</div>
<div class="line"><a name="l00710"></a><span class="lineno">  710</span>&#160;                <span class="keywordflow">if</span> (srcrel[node] != null)</div>
<div class="line"><a name="l00711"></a><span class="lineno">  711</span>&#160;                {</div>
<div class="line"><a name="l00712"></a><span class="lineno">  712</span>&#160;                    a.TempList[srcrel[node]].Add(node);</div>
<div class="line"><a name="l00713"></a><span class="lineno">  713</span>&#160;                }</div>
<div class="line"><a name="l00714"></a><span class="lineno">  714</span>&#160;            }</div>
<div class="line"><a name="l00715"></a><span class="lineno">  715</span>&#160;            <span class="keywordflow">foreach</span> (T node <span class="keywordflow">in</span> nodes)</div>
<div class="line"><a name="l00716"></a><span class="lineno">  716</span>&#160;            {</div>
<div class="line"><a name="l00717"></a><span class="lineno">  717</span>&#160;                dstrel[node] = a.TempList[node].ToArray();</div>
<div class="line"><a name="l00718"></a><span class="lineno">  718</span>&#160;            }</div>
<div class="line"><a name="l00719"></a><span class="lineno">  719</span>&#160;            a.TempList.Clear(nodes);</div>
<div class="line"><a name="l00720"></a><span class="lineno">  720</span>&#160;        }</div>
<div class="line"><a name="l00721"></a><span class="lineno">  721</span>&#160;</div>
<div class="line"><a name="l00729"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#af536d2d1a3a116676e9fea1ce91d5c22">  729</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">void</span> InvertRelation&lt;T&gt;(<span class="keyword">this</span> <a class="code" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html">IGraphAdapter&lt;T&gt;</a> a,</div>
<div class="line"><a name="l00730"></a><span class="lineno">  730</span>&#160;            IPropMap&lt;T, T[]&gt; srcrel, IPropMap&lt;T, T[]&gt; dstrel, IEnumerable&lt;T&gt; nodes)</div>
<div class="line"><a name="l00731"></a><span class="lineno">  731</span>&#160;        {</div>
<div class="line"><a name="l00732"></a><span class="lineno">  732</span>&#160;            a.CreateDefaultTempStorage(nodes);</div>
<div class="line"><a name="l00733"></a><span class="lineno">  733</span>&#160;            srcrel.RequireAccess(EAccess.ReadOnly);</div>
<div class="line"><a name="l00734"></a><span class="lineno">  734</span>&#160;            dstrel.RequireAccess(EAccess.WriteOnly);</div>
<div class="line"><a name="l00735"></a><span class="lineno">  735</span>&#160;            <span class="keywordflow">foreach</span> (T node <span class="keywordflow">in</span> nodes)</div>
<div class="line"><a name="l00736"></a><span class="lineno">  736</span>&#160;            {</div>
<div class="line"><a name="l00737"></a><span class="lineno">  737</span>&#160;                <span class="keywordflow">foreach</span> (T adj <span class="keywordflow">in</span> srcrel[node])</div>
<div class="line"><a name="l00738"></a><span class="lineno">  738</span>&#160;                {</div>
<div class="line"><a name="l00739"></a><span class="lineno">  739</span>&#160;                    a.TempList[adj].Add(node);</div>
<div class="line"><a name="l00740"></a><span class="lineno">  740</span>&#160;                }</div>
<div class="line"><a name="l00741"></a><span class="lineno">  741</span>&#160;            }</div>
<div class="line"><a name="l00742"></a><span class="lineno">  742</span>&#160;            <span class="keywordflow">foreach</span> (T node <span class="keywordflow">in</span> nodes)</div>
<div class="line"><a name="l00743"></a><span class="lineno">  743</span>&#160;            {</div>
<div class="line"><a name="l00744"></a><span class="lineno">  744</span>&#160;                dstrel[node] = a.TempList[node].ToArray();</div>
<div class="line"><a name="l00745"></a><span class="lineno">  745</span>&#160;            }</div>
<div class="line"><a name="l00746"></a><span class="lineno">  746</span>&#160;            a.TempList.Clear(nodes);</div>
<div class="line"><a name="l00747"></a><span class="lineno">  747</span>&#160;        }</div>
<div class="line"><a name="l00748"></a><span class="lineno">  748</span>&#160;</div>
<div class="line"><a name="l00754"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#ae409eb2323b5f5d51d555132c769ce5f">  754</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">void</span> ComputeSuccessorsFromParent&lt;T&gt;(<span class="keyword">this</span> <a class="code" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html">IGraphAdapter&lt;T&gt;</a> a, IEnumerable&lt;T&gt; nodes)</div>
<div class="line"><a name="l00755"></a><span class="lineno">  755</span>&#160;        {</div>
<div class="line"><a name="l00756"></a><span class="lineno">  756</span>&#160;            a.InvertRelation(a.Parent, a.Succs, nodes);</div>
<div class="line"><a name="l00757"></a><span class="lineno">  757</span>&#160;        }</div>
<div class="line"><a name="l00758"></a><span class="lineno">  758</span>&#160;</div>
<div class="line"><a name="l00764"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a3affcff37870aae491a1e0a652e442b6">  764</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">void</span> ComputePredecessorsFromSuccessors&lt;T&gt;(<span class="keyword">this</span> <a class="code" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html">IGraphAdapter&lt;T&gt;</a> a, IEnumerable&lt;T&gt; nodes)</div>
<div class="line"><a name="l00765"></a><span class="lineno">  765</span>&#160;        {</div>
<div class="line"><a name="l00766"></a><span class="lineno">  766</span>&#160;            a.InvertRelation(a.Succs, a.Preds, nodes);</div>
<div class="line"><a name="l00767"></a><span class="lineno">  767</span>&#160;        }</div>
<div class="line"><a name="l00768"></a><span class="lineno">  768</span>&#160;</div>
<div class="line"><a name="l00769"></a><span class="lineno">  769</span>&#160;        <span class="keyword">private</span> <span class="keyword">static</span> <span class="keywordtype">void</span> PreOrderDFS&lt;T&gt;(<span class="keyword">this</span> <a class="code" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html">IGraphAdapter&lt;T&gt;</a> a, </div>
<div class="line"><a name="l00770"></a><span class="lineno">  770</span>&#160;            T[] result, T node, ref <span class="keywordtype">int</span> index)</div>
<div class="line"><a name="l00771"></a><span class="lineno">  771</span>&#160;        {</div>
<div class="line"><a name="l00772"></a><span class="lineno">  772</span>&#160;            Contract.Requires&lt;ArgumentNullException&gt;(a != null);</div>
<div class="line"><a name="l00773"></a><span class="lineno">  773</span>&#160;            Contract.Requires&lt;ArgumentNullException&gt;(result != null);</div>
<div class="line"><a name="l00774"></a><span class="lineno">  774</span>&#160;            Contract.Requires&lt;ArgumentException&gt;(index &gt;= 0);</div>
<div class="line"><a name="l00775"></a><span class="lineno">  775</span>&#160;            Contract.Requires&lt;ArgumentException&gt;(index &lt; result.Length);</div>
<div class="line"><a name="l00776"></a><span class="lineno">  776</span>&#160;</div>
<div class="line"><a name="l00777"></a><span class="lineno">  777</span>&#160;            result[index] = node;</div>
<div class="line"><a name="l00778"></a><span class="lineno">  778</span>&#160;            a.PreOrderIndex[node] = index++;</div>
<div class="line"><a name="l00779"></a><span class="lineno">  779</span>&#160;            <span class="keywordflow">foreach</span> (T child <span class="keywordflow">in</span> a.Succs[node])</div>
<div class="line"><a name="l00780"></a><span class="lineno">  780</span>&#160;            {</div>
<div class="line"><a name="l00781"></a><span class="lineno">  781</span>&#160;                <span class="keywordflow">if</span> (a.PreOrderIndex[child] &lt; 0)</div>
<div class="line"><a name="l00782"></a><span class="lineno">  782</span>&#160;                    a.PreOrderDFS(result, child, ref index);</div>
<div class="line"><a name="l00783"></a><span class="lineno">  783</span>&#160;            }</div>
<div class="line"><a name="l00784"></a><span class="lineno">  784</span>&#160;            a.PreOrderLast[node] = result[index - 1];</div>
<div class="line"><a name="l00785"></a><span class="lineno">  785</span>&#160;        }</div>
<div class="line"><a name="l00786"></a><span class="lineno">  786</span>&#160;</div>
<div class="line"><a name="l00795"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#ab742b382c2eb84bc70e05072433e88f7">  795</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> T[] GetPreOrder&lt;T&gt;(<span class="keyword">this</span> <a class="code" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html">IGraphAdapter&lt;T&gt;</a> a,</div>
<div class="line"><a name="l00796"></a><span class="lineno">  796</span>&#160;            IList&lt;T&gt; nodes, T start)</div>
<div class="line"><a name="l00797"></a><span class="lineno">  797</span>&#160;        {</div>
<div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;            a.PreOrderIndex.Reset(nodes, -1);</div>
<div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;            T[] result = <span class="keyword">new</span> T[nodes.Count];</div>
<div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160;            <span class="keywordtype">int</span> index = 0;</div>
<div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;            a.PreOrderDFS(result, start, ref index);</div>
<div class="line"><a name="l00802"></a><span class="lineno">  802</span>&#160;            <span class="comment">// if some nodes are unreachable, the last elements of the result</span></div>
<div class="line"><a name="l00803"></a><span class="lineno">  803</span>&#160;            <span class="comment">// array are null. These should be eliminated:</span></div>
<div class="line"><a name="l00804"></a><span class="lineno">  804</span>&#160;            result = result.Where(x =&gt; x != null).ToArray();</div>
<div class="line"><a name="l00805"></a><span class="lineno">  805</span>&#160;            <span class="keywordflow">return</span> result;</div>
<div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;        }</div>
<div class="line"><a name="l00807"></a><span class="lineno">  807</span>&#160;</div>
<div class="line"><a name="l00816"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#aa1b2c48d35aa188ac914a0096e8e605f">  816</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> T[] GetPreOrder&lt;T&gt;(<span class="keyword">this</span> <a class="code" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html">IGraphAdapter&lt;T&gt;</a> a,</div>
<div class="line"><a name="l00817"></a><span class="lineno">  817</span>&#160;            IList&lt;T&gt; nodes)</div>
<div class="line"><a name="l00818"></a><span class="lineno">  818</span>&#160;        {</div>
<div class="line"><a name="l00819"></a><span class="lineno">  819</span>&#160;            a.PreOrderIndex.Reset(nodes, -1);</div>
<div class="line"><a name="l00820"></a><span class="lineno">  820</span>&#160;            T[] result = <span class="keyword">new</span> T[nodes.Count];            </div>
<div class="line"><a name="l00821"></a><span class="lineno">  821</span>&#160;            <span class="keywordtype">int</span> index = 0;</div>
<div class="line"><a name="l00822"></a><span class="lineno">  822</span>&#160;            IEnumerable&lt;T&gt; starts = nodes.Where(x =&gt; a.Parent[x] == null);</div>
<div class="line"><a name="l00823"></a><span class="lineno">  823</span>&#160;            <span class="keywordflow">foreach</span> (T start <span class="keywordflow">in</span> starts)</div>
<div class="line"><a name="l00824"></a><span class="lineno">  824</span>&#160;            {</div>
<div class="line"><a name="l00825"></a><span class="lineno">  825</span>&#160;                a.PreOrderDFS(result, start, ref index);</div>
<div class="line"><a name="l00826"></a><span class="lineno">  826</span>&#160;            }</div>
<div class="line"><a name="l00827"></a><span class="lineno">  827</span>&#160;            <span class="comment">// if some nodes are unreachable, the last elements of the result</span></div>
<div class="line"><a name="l00828"></a><span class="lineno">  828</span>&#160;            <span class="comment">// array are null. These should be eliminated:</span></div>
<div class="line"><a name="l00829"></a><span class="lineno">  829</span>&#160;            result = result.Where(x =&gt; x != null).ToArray();</div>
<div class="line"><a name="l00830"></a><span class="lineno">  830</span>&#160;            <span class="keywordflow">return</span> result;</div>
<div class="line"><a name="l00831"></a><span class="lineno">  831</span>&#160;        }</div>
<div class="line"><a name="l00832"></a><span class="lineno">  832</span>&#160;</div>
<div class="line"><a name="l00833"></a><span class="lineno">  833</span>&#160;        <span class="keyword">private</span> <span class="keyword">static</span> <span class="keywordtype">void</span> PostOrderDFS&lt;T&gt;(</div>
<div class="line"><a name="l00834"></a><span class="lineno">  834</span>&#160;            IPropMap&lt;T, T[]&gt; succs, IPropMap&lt;T, int&gt; indexMap,</div>
<div class="line"><a name="l00835"></a><span class="lineno">  835</span>&#160;            Stack&lt;T&gt; result, T node, ref <span class="keywordtype">int</span> index)</div>
<div class="line"><a name="l00836"></a><span class="lineno">  836</span>&#160;        {</div>
<div class="line"><a name="l00837"></a><span class="lineno">  837</span>&#160;            Contract.Requires&lt;ArgumentNullException&gt;(succs != null);</div>
<div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160;            Contract.Requires&lt;ArgumentNullException&gt;(indexMap != null);</div>
<div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;            Contract.Requires&lt;ArgumentNullException&gt;(result != null);</div>
<div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;</div>
<div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;            <span class="keywordflow">if</span> (indexMap[node] &lt; 0)</div>
<div class="line"><a name="l00842"></a><span class="lineno">  842</span>&#160;            {</div>
<div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160;                indexMap[node] = index++;</div>
<div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160;                <span class="keywordflow">foreach</span> (T succ <span class="keywordflow">in</span> succs[node])</div>
<div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160;                {</div>
<div class="line"><a name="l00846"></a><span class="lineno">  846</span>&#160;                    PostOrderDFS(succs, indexMap, result, succ, ref index);</div>
<div class="line"><a name="l00847"></a><span class="lineno">  847</span>&#160;                }</div>
<div class="line"><a name="l00848"></a><span class="lineno">  848</span>&#160;            }</div>
<div class="line"><a name="l00849"></a><span class="lineno">  849</span>&#160;            result.Push(node);</div>
<div class="line"><a name="l00850"></a><span class="lineno">  850</span>&#160;        }</div>
<div class="line"><a name="l00851"></a><span class="lineno">  851</span>&#160;</div>
<div class="line"><a name="l00861"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#aaf9124d675ae402b5ae159ee1d9562ca">  861</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> T[] GetPostOrder&lt;T&gt;(IPropMap&lt;T, T[]&gt; succrel, </div>
<div class="line"><a name="l00862"></a><span class="lineno">  862</span>&#160;            IPropMap&lt;T, int&gt; indexMap,</div>
<div class="line"><a name="l00863"></a><span class="lineno">  863</span>&#160;            IList&lt;T&gt; nodes, T start, <span class="keywordtype">bool</span> reverse)</div>
<div class="line"><a name="l00864"></a><span class="lineno">  864</span>&#160;        {</div>
<div class="line"><a name="l00865"></a><span class="lineno">  865</span>&#160;            indexMap.Reset(nodes, -1);</div>
<div class="line"><a name="l00866"></a><span class="lineno">  866</span>&#160;            Stack&lt;T&gt; result = <span class="keyword">new</span> Stack&lt;T&gt;();</div>
<div class="line"><a name="l00867"></a><span class="lineno">  867</span>&#160;            <span class="keywordtype">int</span> index = 0;</div>
<div class="line"><a name="l00868"></a><span class="lineno">  868</span>&#160;            PostOrderDFS(succrel, indexMap, result, start, ref index);</div>
<div class="line"><a name="l00869"></a><span class="lineno">  869</span>&#160;            indexMap.Reset(nodes, -1);</div>
<div class="line"><a name="l00870"></a><span class="lineno">  870</span>&#160;            List&lt;T&gt; order = <span class="keyword">new</span> List&lt;T&gt;(nodes.Count);</div>
<div class="line"><a name="l00871"></a><span class="lineno">  871</span>&#160;            index = 0;</div>
<div class="line"><a name="l00872"></a><span class="lineno">  872</span>&#160;            <span class="keywordflow">foreach</span> (T node <span class="keywordflow">in</span> result)</div>
<div class="line"><a name="l00873"></a><span class="lineno">  873</span>&#160;            {</div>
<div class="line"><a name="l00874"></a><span class="lineno">  874</span>&#160;                <span class="keywordflow">if</span> (indexMap[node] &lt; 0)</div>
<div class="line"><a name="l00875"></a><span class="lineno">  875</span>&#160;                {</div>
<div class="line"><a name="l00876"></a><span class="lineno">  876</span>&#160;                    order.Add(node);</div>
<div class="line"><a name="l00877"></a><span class="lineno">  877</span>&#160;                    indexMap[node] = index++;</div>
<div class="line"><a name="l00878"></a><span class="lineno">  878</span>&#160;                }</div>
<div class="line"><a name="l00879"></a><span class="lineno">  879</span>&#160;            }</div>
<div class="line"><a name="l00880"></a><span class="lineno">  880</span>&#160;            <span class="keywordflow">if</span> (reverse)</div>
<div class="line"><a name="l00881"></a><span class="lineno">  881</span>&#160;                order.Reverse();</div>
<div class="line"><a name="l00882"></a><span class="lineno">  882</span>&#160;            <span class="keywordflow">return</span> order.ToArray();</div>
<div class="line"><a name="l00883"></a><span class="lineno">  883</span>&#160;        }</div>
<div class="line"><a name="l00884"></a><span class="lineno">  884</span>&#160;</div>
<div class="line"><a name="l00890"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a4bd65ffbbadb4eedaae40cec64276ad1">  890</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">bool</span> IsAncestor&lt;T&gt;(</div>
<div class="line"><a name="l00891"></a><span class="lineno">  891</span>&#160;            IPropMap&lt;T, int&gt; indexrel, IPropMap&lt;T, T&gt; lastrel,</div>
<div class="line"><a name="l00892"></a><span class="lineno">  892</span>&#160;            T w, T v)</div>
<div class="line"><a name="l00893"></a><span class="lineno">  893</span>&#160;        {</div>
<div class="line"><a name="l00894"></a><span class="lineno">  894</span>&#160;            <span class="keywordflow">return</span> indexrel[w] &lt;= indexrel[v] &amp;&amp;</div>
<div class="line"><a name="l00895"></a><span class="lineno">  895</span>&#160;                indexrel[v] &lt;= indexrel[lastrel[w]];</div>
<div class="line"><a name="l00896"></a><span class="lineno">  896</span>&#160;        }</div>
<div class="line"><a name="l00897"></a><span class="lineno">  897</span>&#160;</div>
<div class="line"><a name="l00901"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#accca9c1ccf11f560b1741277be1975f8">  901</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">bool</span> IsAncestor&lt;T&gt;(<span class="keyword">this</span> <a class="code" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html">IGraphAdapter&lt;T&gt;</a> a, T w, T v)</div>
<div class="line"><a name="l00902"></a><span class="lineno">  902</span>&#160;        {</div>
<div class="line"><a name="l00903"></a><span class="lineno">  903</span>&#160;            <span class="keywordflow">return</span> IsAncestor(a.PreOrderIndex, a.PreOrderLast, w, v);</div>
<div class="line"><a name="l00904"></a><span class="lineno">  904</span>&#160;        }</div>
<div class="line"><a name="l00905"></a><span class="lineno">  905</span>&#160;</div>
<div class="line"><a name="l00916"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a062ae42f6097aa7767a35fc56a41d9b8">  916</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">void</span> AnalyzeLoops&lt;T&gt;(<span class="keyword">this</span> <a class="code" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html">IGraphAdapter&lt;T&gt;</a> a,</div>
<div class="line"><a name="l00917"></a><span class="lineno">  917</span>&#160;            IList&lt;T&gt; nodes, T start)</div>
<div class="line"><a name="l00918"></a><span class="lineno">  918</span>&#160;        {</div>
<div class="line"><a name="l00919"></a><span class="lineno">  919</span>&#160;            T[] order = a.GetPreOrder(nodes, start);</div>
<div class="line"><a name="l00920"></a><span class="lineno">  920</span>&#160;</div>
<div class="line"><a name="l00921"></a><span class="lineno">  921</span>&#160;            <span class="comment">// fix_loops part</span></div>
<div class="line"><a name="l00922"></a><span class="lineno">  922</span>&#160;<span class="preprocessor">#if false</span></div>
<div class="line"><a name="l00923"></a><span class="lineno">  923</span>&#160;<span class="preprocessor"></span>            <span class="keywordflow">foreach</span> (T w <span class="keywordflow">in</span> order)</div>
<div class="line"><a name="l00924"></a><span class="lineno">  924</span>&#160;            {</div>
<div class="line"><a name="l00925"></a><span class="lineno">  925</span>&#160;                a.RedBackIn[w] = <span class="keyword">new</span> HashSet&lt;T&gt;();</div>
<div class="line"><a name="l00926"></a><span class="lineno">  926</span>&#160;                a.OtherIn[w] = <span class="keyword">new</span> HashSet&lt;T&gt;();</div>
<div class="line"><a name="l00927"></a><span class="lineno">  927</span>&#160;                <span class="keywordflow">foreach</span> (T v <span class="keywordflow">in</span> a.Preds[w])</div>
<div class="line"><a name="l00928"></a><span class="lineno">  928</span>&#160;                {</div>
<div class="line"><a name="l00929"></a><span class="lineno">  929</span>&#160;                    <span class="keywordflow">if</span> (a.PreOrderIndex[w] &lt; a.PreOrderIndex[v])</div>
<div class="line"><a name="l00930"></a><span class="lineno">  930</span>&#160;                        a.RedBackIn[w].Add(v);</div>
<div class="line"><a name="l00931"></a><span class="lineno">  931</span>&#160;                    <span class="keywordflow">else</span></div>
<div class="line"><a name="l00932"></a><span class="lineno">  932</span>&#160;                        a.OtherIn[w].Add(v);</div>
<div class="line"><a name="l00933"></a><span class="lineno">  933</span>&#160;                }</div>
<div class="line"><a name="l00934"></a><span class="lineno">  934</span>&#160;                <span class="keywordflow">if</span> (a.RedBackIn[w].Count &gt; 0 &amp;&amp; a.OtherIn[w].Count &gt; 1)</div>
<div class="line"><a name="l00935"></a><span class="lineno">  935</span>&#160;                {</div>
<div class="line"><a name="l00936"></a><span class="lineno">  936</span>&#160;                    <span class="keywordflow">throw</span> <span class="keyword">new</span> NotImplementedException();</div>
<div class="line"><a name="l00937"></a><span class="lineno">  937</span>&#160;                }</div>
<div class="line"><a name="l00938"></a><span class="lineno">  938</span>&#160;            }</div>
<div class="line"><a name="l00939"></a><span class="lineno">  939</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00940"></a><span class="lineno">  940</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00941"></a><span class="lineno">  941</span>&#160;            <span class="keywordflow">foreach</span> (T w <span class="keywordflow">in</span> order<span class="comment">/*nodes*/</span>)</div>
<div class="line"><a name="l00942"></a><span class="lineno">  942</span>&#160;            {</div>
<div class="line"><a name="l00943"></a><span class="lineno">  943</span>&#160;                a.BackPreds[w] = <span class="keyword">new</span> HashSet&lt;T&gt;();</div>
<div class="line"><a name="l00944"></a><span class="lineno">  944</span>&#160;                a.NonBackPreds[w] = <span class="keyword">new</span> HashSet&lt;T&gt;();</div>
<div class="line"><a name="l00945"></a><span class="lineno">  945</span>&#160;                a.Header[w] = start;</div>
<div class="line"><a name="l00946"></a><span class="lineno">  946</span>&#160;                a.Type[w] = ENodeType.Nonheader;</div>
<div class="line"><a name="l00947"></a><span class="lineno">  947</span>&#160;                <span class="keywordflow">foreach</span> (T v <span class="keywordflow">in</span> a.Preds[w])</div>
<div class="line"><a name="l00948"></a><span class="lineno">  948</span>&#160;                {</div>
<div class="line"><a name="l00949"></a><span class="lineno">  949</span>&#160;                    <span class="keywordflow">if</span> (a.IsAncestor(w, v))</div>
<div class="line"><a name="l00950"></a><span class="lineno">  950</span>&#160;                        a.BackPreds[w].Add(v);</div>
<div class="line"><a name="l00951"></a><span class="lineno">  951</span>&#160;                    <span class="keywordflow">else</span></div>
<div class="line"><a name="l00952"></a><span class="lineno">  952</span>&#160;                        a.NonBackPreds[w].Add(v);</div>
<div class="line"><a name="l00953"></a><span class="lineno">  953</span>&#160;                }</div>
<div class="line"><a name="l00954"></a><span class="lineno">  954</span>&#160;            }</div>
<div class="line"><a name="l00955"></a><span class="lineno">  955</span>&#160;            a.Header[start] = <span class="keywordflow">default</span>(T);</div>
<div class="line"><a name="l00956"></a><span class="lineno">  956</span>&#160;            HashSet&lt;T&gt; P = <span class="keyword">new</span> HashSet&lt;T&gt;();</div>
<div class="line"><a name="l00957"></a><span class="lineno">  957</span>&#160;            <a class="code" href="class_system_sharp_1_1_set_algorithms_1_1_union_find_3_01_t_01_4.html">UnionFind&lt;T&gt;</a> uf = <span class="keyword">new</span> PreOrderSetAdapter&lt;T&gt;(a).CreateUnionFind(order);</div>
<div class="line"><a name="l00958"></a><span class="lineno">  958</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> iw = order.Length - 1; iw &gt;= 0; iw--)</div>
<div class="line"><a name="l00959"></a><span class="lineno">  959</span>&#160;            {</div>
<div class="line"><a name="l00960"></a><span class="lineno">  960</span>&#160;                T w = order[iw];</div>
<div class="line"><a name="l00961"></a><span class="lineno">  961</span>&#160;                P.Clear();</div>
<div class="line"><a name="l00962"></a><span class="lineno">  962</span>&#160;                <span class="keywordflow">foreach</span> (T v <span class="keywordflow">in</span> a.BackPreds[w])</div>
<div class="line"><a name="l00963"></a><span class="lineno">  963</span>&#160;                {</div>
<div class="line"><a name="l00964"></a><span class="lineno">  964</span>&#160;                    <span class="keywordflow">if</span> (!v.Equals(w))</div>
<div class="line"><a name="l00965"></a><span class="lineno">  965</span>&#160;                        P.Add(uf.Find(v));</div>
<div class="line"><a name="l00966"></a><span class="lineno">  966</span>&#160;                    <span class="keywordflow">else</span></div>
<div class="line"><a name="l00967"></a><span class="lineno">  967</span>&#160;                        a.Type[w] = ENodeType.Self;</div>
<div class="line"><a name="l00968"></a><span class="lineno">  968</span>&#160;                }</div>
<div class="line"><a name="l00969"></a><span class="lineno">  969</span>&#160;                Queue&lt;T&gt; worklist = <span class="keyword">new</span> Queue&lt;T&gt;(P);</div>
<div class="line"><a name="l00970"></a><span class="lineno">  970</span>&#160;                <span class="keywordflow">if</span> (P.Count &gt; 0)</div>
<div class="line"><a name="l00971"></a><span class="lineno">  971</span>&#160;                    a.Type[w] = ENodeType.Reducible;</div>
<div class="line"><a name="l00972"></a><span class="lineno">  972</span>&#160;                <span class="keywordflow">while</span> (worklist.Count &gt; 0)</div>
<div class="line"><a name="l00973"></a><span class="lineno">  973</span>&#160;                {</div>
<div class="line"><a name="l00974"></a><span class="lineno">  974</span>&#160;                    T x = worklist.Dequeue();</div>
<div class="line"><a name="l00975"></a><span class="lineno">  975</span>&#160;                    <span class="keywordflow">foreach</span> (T y <span class="keywordflow">in</span> a.NonBackPreds[x])</div>
<div class="line"><a name="l00976"></a><span class="lineno">  976</span>&#160;                    {</div>
<div class="line"><a name="l00977"></a><span class="lineno">  977</span>&#160;                        T y_ = uf.Find(y);</div>
<div class="line"><a name="l00978"></a><span class="lineno">  978</span>&#160;                        <span class="keywordflow">if</span> (!a.IsAncestor(w, y_))</div>
<div class="line"><a name="l00979"></a><span class="lineno">  979</span>&#160;                        {</div>
<div class="line"><a name="l00980"></a><span class="lineno">  980</span>&#160;                            a.Type[w] = ENodeType.Irreducible;</div>
<div class="line"><a name="l00981"></a><span class="lineno">  981</span>&#160;                            a.NonBackPreds[w].Add(y_);</div>
<div class="line"><a name="l00982"></a><span class="lineno">  982</span>&#160;                        }</div>
<div class="line"><a name="l00983"></a><span class="lineno">  983</span>&#160;                        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!P.Contains(y_) &amp;&amp; !w.Equals(y_))</div>
<div class="line"><a name="l00984"></a><span class="lineno">  984</span>&#160;                        {</div>
<div class="line"><a name="l00985"></a><span class="lineno">  985</span>&#160;                            P.Add(y_);</div>
<div class="line"><a name="l00986"></a><span class="lineno">  986</span>&#160;                            worklist.Enqueue(y_);</div>
<div class="line"><a name="l00987"></a><span class="lineno">  987</span>&#160;                        }</div>
<div class="line"><a name="l00988"></a><span class="lineno">  988</span>&#160;                    }</div>
<div class="line"><a name="l00989"></a><span class="lineno">  989</span>&#160;                }</div>
<div class="line"><a name="l00990"></a><span class="lineno">  990</span>&#160;                <span class="keywordflow">foreach</span> (T x <span class="keywordflow">in</span> P)</div>
<div class="line"><a name="l00991"></a><span class="lineno">  991</span>&#160;                {</div>
<div class="line"><a name="l00992"></a><span class="lineno">  992</span>&#160;                    a.Header[x] = w;</div>
<div class="line"><a name="l00993"></a><span class="lineno">  993</span>&#160;                    uf.Union(x, w);</div>
<div class="line"><a name="l00994"></a><span class="lineno">  994</span>&#160;                }</div>
<div class="line"><a name="l00995"></a><span class="lineno">  995</span>&#160;            }</div>
<div class="line"><a name="l00996"></a><span class="lineno">  996</span>&#160;        }</div>
<div class="line"><a name="l00997"></a><span class="lineno">  997</span>&#160;</div>
<div class="line"><a name="l01019"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a7f3cae6dcdf2649c80e1016ef40b863c"> 1019</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">void</span> ComputeImmediateDominators&lt;T&gt;(</div>
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>&#160;            IPropMap&lt;T, T[]&gt; succrel, IPropMap&lt;T, T[]&gt; predrel,</div>
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>&#160;            IPropMap&lt;T, int&gt; index,</div>
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>&#160;            IPropMap&lt;T, T&gt; dom,</div>
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>&#160;            IList&lt;T&gt; nodes, T start) where T: <span class="keyword">class</span></div>
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>&#160;        {</div>
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>&#160;            T[] order = GetPostOrder(succrel, index, nodes, start, <span class="keyword">true</span>);</div>
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>&#160;            dom[start] = start;</div>
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>&#160;            <span class="keywordtype">bool</span> changed = <span class="keyword">true</span>;</div>
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>&#160;            <span class="keywordflow">while</span> (changed)</div>
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>&#160;            {</div>
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>&#160;                changed = <span class="keyword">false</span>;</div>
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>&#160;                <span class="keywordflow">foreach</span> (T node <span class="keywordflow">in</span> order)</div>
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>&#160;                {</div>
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>&#160;                    <span class="keywordflow">if</span> (node.Equals(start))</div>
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>&#160;                        <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>&#160;</div>
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>&#160;                    T newIdom = null;</div>
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>&#160;                    T[] preds = predrel[node];</div>
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>&#160;                    <span class="keywordflow">foreach</span> (T p <span class="keywordflow">in</span> preds)</div>
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>&#160;                    {</div>
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>&#160;                        <span class="keywordflow">if</span> (dom[p] != null)</div>
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>&#160;                        {</div>
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>&#160;                            <span class="keywordflow">if</span> (newIdom == null)</div>
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>&#160;                                newIdom = p;</div>
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>&#160;                            <span class="keywordflow">else</span></div>
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>&#160;                                newIdom = Intersect(dom, index, p, newIdom);</div>
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>&#160;                        }</div>
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>&#160;                    }</div>
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>&#160;                    <span class="keywordflow">if</span> (dom[node] != newIdom)</div>
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>&#160;                    {</div>
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>&#160;                        dom[node] = newIdom;</div>
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>&#160;                        changed = <span class="keyword">true</span>;</div>
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>&#160;                    }</div>
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>&#160;                }</div>
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>&#160;            }</div>
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>&#160;        }</div>
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>&#160;</div>
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>&#160;        <span class="keyword">private</span> <span class="keyword">static</span> T Intersect&lt;T&gt;(</div>
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>&#160;            IPropMap&lt;T, T&gt; dom, IPropMap&lt;T, int&gt; index,</div>
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>&#160;            T b1, T b2) where T: <span class="keyword">class</span></div>
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>&#160;        {</div>
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>&#160;            T finger1 = b1;</div>
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>&#160;            T finger2 = b2;</div>
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>&#160;            <span class="keywordflow">while</span> (finger1 != finger2)</div>
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>&#160;            {</div>
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>&#160;                <span class="keywordflow">while</span> (index[finger1] &gt; index[finger2])</div>
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>&#160;                    finger1 = dom[finger1];</div>
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>&#160;                <span class="keywordflow">while</span> (index[finger2] &gt; index[finger1])</div>
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>&#160;                    finger2 = dom[finger2];</div>
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>&#160;            }</div>
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>&#160;            <span class="keywordflow">return</span> finger1;</div>
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>&#160;        }</div>
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>&#160;</div>
<div class="line"><a name="l01081"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a5b97968e46c9f611b6867205c9230361"> 1081</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">void</span> ComputeImmediateDominators&lt;T&gt;(<span class="keyword">this</span> <a class="code" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html">IGraphAdapter&lt;T&gt;</a> a,</div>
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>&#160;            IList&lt;T&gt; nodes, T entry) where T: <span class="keyword">class</span></div>
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>&#160;        {</div>
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>&#160;            ComputeImmediateDominators(a.Succs, a.Preds, a.PostOrderIndex,</div>
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>&#160;                a.IDom, nodes, entry);</div>
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>&#160;            a.IDom[entry] = null;</div>
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>&#160;            a.InvertRelation(a.IDom, a.IDoms, nodes);</div>
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>&#160;            a.IDom[entry] = entry;</div>
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>&#160;        }</div>
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>&#160;</div>
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>&#160;        <span class="comment">/*public static void ComputeImmediatePostDominators&lt;T&gt;(this IGraphAdapter&lt;T&gt; a,</span></div>
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>&#160;<span class="comment">            IList&lt;T&gt; nodes, T exit) where T : class</span></div>
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>&#160;<span class="comment">        {</span></div>
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>&#160;<span class="comment">            if (a.Preds[exit].Length == 0)</span></div>
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>&#160;<span class="comment">            { </span></div>
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>&#160;<span class="comment">                // special case: exit code is not reachable.</span></div>
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>&#160;<span class="comment">                // This can happen due to infinite loops which do not return from the </span></div>
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>&#160;<span class="comment">                // current method.</span></div>
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>&#160;<span class="comment">                // no fix yet...</span></div>
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>&#160;<span class="comment">            }</span></div>
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>&#160;<span class="comment">            ComputeImmediateDominators(a.Preds, a.Succs, a.PostOrderIndex,</span></div>
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>&#160;<span class="comment">                a.IPDom, nodes, exit);</span></div>
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>&#160;<span class="comment">            a.IPDom[exit] = null;</span></div>
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>&#160;<span class="comment">            a.InvertRelation(a.IPDom, a.IPDoms, nodes);</span></div>
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>&#160;<span class="comment">            a.IPDom[exit] = exit;</span></div>
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>&#160;<span class="comment">        }*/</span></div>
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>&#160;</div>
<div class="line"><a name="l01119"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html#a8a496b0f86e71a02eddbcfe4214c0322"> 1119</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">void</span> GetLCATree&lt;T&gt;(IEnumerable&lt;T&gt; nodes, IPropMap&lt;T, T&gt; prel, T root, IPropMap&lt;T, int&gt; porel, </div>
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>&#160;            IPropMap&lt;T, T&gt; lprel)</div>
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>&#160;        {</div>
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>&#160;            PriorityQueue&lt;Tuple&lt;T, T&gt;&gt; pq = <span class="keyword">new</span> PriorityQueue&lt;Tuple&lt;T, T&gt;&gt;();</div>
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>&#160;            pq.Resolve = (x, y) =&gt;</div>
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>&#160;            {</div>
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>&#160;                <span class="keywordflow">if</span> (!<span class="keywordtype">object</span>.Equals(x.Item1, x.Item2))</div>
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>&#160;                    lprel[x.Item1] = x.Item2;</div>
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>&#160;                if (!<span class="keywordtype">object</span>.Equals(y.Item1, x.Item2))</div>
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>&#160;                    lprel[y.Item1] = x.Item2;</div>
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>&#160;                <span class="keywordflow">return</span> Tuple.Create(x.Item2, x.Item2);</div>
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>&#160;            };</div>
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>&#160;            <span class="keywordflow">foreach</span> (T node <span class="keywordflow">in</span> nodes)</div>
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>&#160;            {</div>
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>&#160;                pq.Enqueue(-porel[node], Tuple.Create(node, node));</div>
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>&#160;            }</div>
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>&#160;            <span class="keywordflow">while</span> (!pq.IsEmpty)</div>
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>&#160;            {</div>
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>&#160;                var kvp = pq.Dequeue();</div>
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>&#160;                <span class="keywordflow">if</span> (<span class="keywordtype">object</span>.Equals(kvp.Value.Item2, root))</div>
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>&#160;                    <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>&#160;                var par = prel[kvp.Value.Item2];</div>
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>&#160;                var next = Tuple.Create(kvp.Value.Item1, par);</div>
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>&#160;                pq.Enqueue(-porel[next.Item2], next);</div>
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>&#160;            }</div>
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>&#160;        }</div>
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>&#160;    }</div>
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>&#160;</div>
<div class="line"><a name="l01150"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_dijkstra.html"> 1150</a></span>&#160;    <span class="keyword">public</span> <span class="keyword">static</span> <span class="keyword">class </span><a class="code" href="class_system_sharp_1_1_tree_algorithms_1_1_dijkstra.html">Dijkstra</a></div>
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>&#160;    {</div>
<div class="line"><a name="l01162"></a><span class="lineno"><a class="line" href="class_system_sharp_1_1_tree_algorithms_1_1_dijkstra.html#a904ad3f74a8cfce5f596c9e50418175f"> 1162</a></span>&#160;        <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">void</span> FindShortestPaths&lt;T&gt;(IEnumerable&lt;T&gt; nodes, T start,</div>
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>&#160;            IPropMap&lt;T, T[]&gt; succs, IPropMap&lt;T, int&gt; rootDist, IPropMap&lt;T, T&gt; pred,</div>
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>&#160;            IPropMap&lt;Tuple&lt;T, T&gt;, <span class="keywordtype">int</span>&gt; dist)</div>
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>&#160;        {</div>
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>&#160;            <span class="keywordflow">foreach</span> (T node <span class="keywordflow">in</span> nodes)</div>
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>&#160;            {</div>
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>&#160;                rootDist[node] = int.MaxValue;</div>
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>&#160;                pred[node] = <span class="keywordflow">default</span>(T);</div>
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>&#160;            }</div>
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>&#160;            rootDist[start] = 0;</div>
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>&#160;</div>
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>&#160;            PriorityQueue&lt;IEnumerable&lt;T&gt;&gt; q = <span class="keyword">new</span> PriorityQueue&lt;IEnumerable&lt;T&gt;&gt;()</div>
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>&#160;            {</div>
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>&#160;                Resolve = (x, y) =&gt; x.Union(y).Distinct()</div>
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>&#160;            };</div>
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>&#160;            q.Enqueue(0, Enumerable.Repeat(start, 1));</div>
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>&#160;            <span class="keywordflow">while</span> (!q.IsEmpty)</div>
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>&#160;            {</div>
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>&#160;                var kvp = q.Dequeue();</div>
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>&#160;                <span class="keywordtype">int</span> d = (int)kvp.Key;</div>
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>&#160;                IEnumerable&lt;T&gt; curs = kvp.Value;</div>
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>&#160;                foreach (T cur in curs)</div>
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>&#160;                {</div>
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>&#160;                    <span class="keywordflow">if</span> (d != rootDist[cur])</div>
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>&#160;                        <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>&#160;                    <span class="keywordflow">foreach</span> (T succ <span class="keywordflow">in</span> succs[cur])</div>
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>&#160;                    {</div>
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>&#160;                        <span class="keywordtype">int</span> newDist = rootDist[cur] + dist[Tuple.Create(cur, succ)];</div>
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>&#160;                        <span class="keywordflow">if</span> (newDist &lt; rootDist[succ])</div>
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>&#160;                        {</div>
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>&#160;                            rootDist[succ] = newDist;</div>
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>&#160;                            pred[succ] = cur;</div>
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>&#160;                            q.Enqueue(newDist, Enumerable.Repeat(succ, 1));</div>
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>&#160;                        }</div>
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>&#160;                    }</div>
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>&#160;                }</div>
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>&#160;            }</div>
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>&#160;        }</div>
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>&#160;    }</div>
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>&#160;}</div>
<div class="ttc" id="class_system_sharp_1_1_tree_algorithms_1_1_delegate_prop_map_3_01_t_this_00_01_t_value_01_4_html_a11ca7ecb318f427fdf636d9d29323424"><div class="ttname"><a href="class_system_sharp_1_1_tree_algorithms_1_1_delegate_prop_map_3_01_t_this_00_01_t_value_01_4.html#a11ca7ecb318f427fdf636d9d29323424">SystemSharp.TreeAlgorithms.DelegatePropMap&lt; TThis, TValue &gt;.DelegatePropMap</a></div><div class="ttdeci">DelegatePropMap(GetterFunc&lt; TThis, TValue &gt; get, SetterFunc&lt; TThis, TValue &gt; set)</div><div class="ttdoc">Constructs a new instance capable of reading and writing property values. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l00174">TreeAlgorithms.cs:174</a></div></div>
<div class="ttc" id="namespace_system_sharp_1_1_tree_algorithms_html_a6a1436f9b943edaf1ab43d5a5df6d004a70a2a84088d405a2e3f1e3accaa16723"><div class="ttname"><a href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004a70a2a84088d405a2e3f1e3accaa16723">SystemSharp.TreeAlgorithms.ReadWrite</a></div></div>
<div class="ttc" id="class_system_sharp_1_1_tree_algorithms_1_1_delegate_prop_map_3_01_t_this_00_01_t_value_01_4_html_a887316b1a499c15932fc581dc730ce0a"><div class="ttname"><a href="class_system_sharp_1_1_tree_algorithms_1_1_delegate_prop_map_3_01_t_this_00_01_t_value_01_4.html#a887316b1a499c15932fc581dc730ce0a">SystemSharp.TreeAlgorithms.DelegatePropMap&lt; TThis, TValue &gt;.DelegatePropMap</a></div><div class="ttdeci">DelegatePropMap(GetterFunc&lt; TThis, TValue &gt; get)</div><div class="ttdoc">Constructs a new instance capable of reading property values. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l00184">TreeAlgorithms.cs:184</a></div></div>
<div class="ttc" id="namespace_system_sharp_1_1_tree_algorithms_html_a6a1436f9b943edaf1ab43d5a5df6d004a53dfe5089ae9e65887cb0215cb0098f5"><div class="ttname"><a href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004a53dfe5089ae9e65887cb0215cb0098f5">SystemSharp.TreeAlgorithms.WriteOnly</a></div></div>
<div class="ttc" id="class_system_sharp_1_1_tree_algorithms_1_1_cache_based_prop_map_3_01_t_this_00_01_t_value_01_4_html_a78860facc8fcc18e60443503b06592fe"><div class="ttname"><a href="class_system_sharp_1_1_tree_algorithms_1_1_cache_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#a78860facc8fcc18e60443503b06592fe">SystemSharp.TreeAlgorithms.CacheBasedPropMap&lt; TThis, TValue &gt;.CacheBasedPropMap</a></div><div class="ttdeci">CacheBasedPropMap(Func&lt; TThis, TValue &gt; creator)</div><div class="ttdoc">Constructs a new instance. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l00318">TreeAlgorithms.cs:318</a></div></div>
<div class="ttc" id="class_system_sharp_1_1_tree_algorithms_1_1_delegate_prop_map_3_01_t_this_00_01_t_value_01_4_html_acbf5c506677e7d8212b87b93035ba02d"><div class="ttname"><a href="class_system_sharp_1_1_tree_algorithms_1_1_delegate_prop_map_3_01_t_this_00_01_t_value_01_4.html#acbf5c506677e7d8212b87b93035ba02d">SystemSharp.TreeAlgorithms.DelegatePropMap&lt; TThis, TValue &gt;.DelegatePropMap</a></div><div class="ttdeci">DelegatePropMap(SetterFunc&lt; TThis, TValue &gt; set)</div><div class="ttdoc">Constructs a new instance capable of writing property values. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l00193">TreeAlgorithms.cs:193</a></div></div>
<div class="ttc" id="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations_html"><div class="ttname"><a href="class_system_sharp_1_1_tree_algorithms_1_1_tree_operations.html">SystemSharp.TreeAlgorithms.TreeOperations</a></div><div class="ttdoc">This static class provides extension methods to simplify the usage of property maps. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l00599">TreeAlgorithms.cs:599</a></div></div>
<div class="ttc" id="class_system_sharp_1_1_tree_algorithms_1_1_hash_based_prop_map_3_01_t_this_00_01_t_value_01_4_html_a1f453fd4b409fcad63662cf7a8e6587b"><div class="ttname"><a href="class_system_sharp_1_1_tree_algorithms_1_1_hash_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#a1f453fd4b409fcad63662cf7a8e6587b">SystemSharp.TreeAlgorithms.HashBasedPropMap&lt; TThis, TValue &gt;.ContainsKey</a></div><div class="ttdeci">bool ContainsKey(TThis key)</div><div class="ttdoc">Returns true if the underlying dictionary contains the given key. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l00269">TreeAlgorithms.cs:269</a></div></div>
<div class="ttc" id="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4_html_a2319fbfb586a0e1a168a6383f07672cb"><div class="ttname"><a href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html#a2319fbfb586a0e1a168a6383f07672cb">SystemSharp.TreeAlgorithms.HashingGraphAdapter&lt; T &gt;.HashingGraphAdapter</a></div><div class="ttdeci">HashingGraphAdapter()</div><div class="ttdoc">Constructs an instance. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l00556">TreeAlgorithms.cs:556</a></div></div>
<div class="ttc" id="interface_system_sharp_1_1_tree_algorithms_1_1_i_prop_map_3_01_t_this_00_01_t_value_01_4_html"><div class="ttname"><a href="interface_system_sharp_1_1_tree_algorithms_1_1_i_prop_map_3_01_t_this_00_01_t_value_01_4.html">SystemSharp.TreeAlgorithms.IPropMap&lt; TThis, TValue &gt;</a></div><div class="ttdoc">Property map interface. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l00047">TreeAlgorithms.cs:47</a></div></div>
<div class="ttc" id="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4_html_a7e1e0a8b9f16e98615e0d54d88988647"><div class="ttname"><a href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html#a7e1e0a8b9f16e98615e0d54d88988647">SystemSharp.TreeAlgorithms.DefaultTreeAdapter&lt; T &gt;.DefaultTreeAdapter</a></div><div class="ttdeci">DefaultTreeAdapter(GetterFunc&lt; T, T &gt; getParent, GetterFunc&lt; T, T[]&gt; getChildren, SetterFunc&lt; T, T[]&gt; setChildren, GetterFunc&lt; T, T[]&gt; getPreds, SetterFunc&lt; T, T[]&gt; setPreds, GetterFunc&lt; T, List&lt; T &gt;&gt; getTempList, SetterFunc&lt; T, List&lt; T &gt;&gt; setTempList, GetterFunc&lt; T, int &gt; getPreOrderIndex, SetterFunc&lt; T, int &gt; setPreOrderIndex, GetterFunc&lt; T, T &gt; getPreOrderLast, SetterFunc&lt; T, T &gt; setPreOrderLast, GetterFunc&lt; T, int &gt; getPostOrderIndex, SetterFunc&lt; T, int &gt; setPostOrderIndex, GetterFunc&lt; T, ENodeType &gt; getType, SetterFunc&lt; T, ENodeType &gt; setType, GetterFunc&lt; T, HashSet&lt; T &gt;&gt; getBackPreds, SetterFunc&lt; T, HashSet&lt; T &gt;&gt; setBackPreds, GetterFunc&lt; T, HashSet&lt; T &gt;&gt; getNonBackPreds, SetterFunc&lt; T, HashSet&lt; T &gt;&gt; setNonBackPreds, GetterFunc&lt; T, HashSet&lt; T &gt;&gt; getRedBackIn, SetterFunc&lt; T, HashSet&lt; T &gt;&gt; setRedBackIn, GetterFunc&lt; T, HashSet&lt; T &gt;&gt; getOtherIn, SetterFunc&lt; T, HashSet&lt; T &gt;&gt; setOtherIn, GetterFunc&lt; T, T &gt; getHeader, SetterFunc&lt; T, T &gt; setHeader, GetterFunc&lt; T, T &gt; getIDom, SetterFunc&lt; T, T &gt; setIDom, GetterFunc&lt; T, T[]&gt; getIDoms, SetterFunc&lt; T, T[]&gt; setIDoms)</div><div class="ttdoc">Constructs a new instance. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l00473">TreeAlgorithms.cs:473</a></div></div>
<div class="ttc" id="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4_html"><div class="ttname"><a href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html">SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;</a></div><div class="ttdoc">Adapter interface to tree analysis algorithms. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l00077">TreeAlgorithms.cs:77</a></div></div>
<div class="ttc" id="namespace_system_sharp_1_1_tree_algorithms_html_ae272cf940377ca4e0094c847c51dedd4"><div class="ttname"><a href="namespace_system_sharp_1_1_tree_algorithms.html#ae272cf940377ca4e0094c847c51dedd4">SystemSharp.TreeAlgorithms.GetterFunc&lt; TThis, TValue &gt;</a></div><div class="ttdeci">delegate TValue GetterFunc&lt; TThis, TValue &gt;(TThis elem)</div></div>
<div class="ttc" id="class_system_sharp_1_1_tree_algorithms_1_1_array_backed_prop_map_3_01_t_key_00_01_t_value_01_4_html"><div class="ttname"><a href="class_system_sharp_1_1_tree_algorithms_1_1_array_backed_prop_map_3_01_t_key_00_01_t_value_01_4.html">SystemSharp.TreeAlgorithms.ArrayBackedPropMap&lt; TKey, TValue &gt;</a></div><div class="ttdoc">An array-based IPropMap&lt;&gt; implementation. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l00365">TreeAlgorithms.cs:365</a></div></div>
<div class="ttc" id="class_system_sharp_1_1_tree_algorithms_1_1_hash_based_prop_map_3_01_t_this_00_01_t_value_01_4_html_a5b34d571e076eed81412e62e6485c30d"><div class="ttname"><a href="class_system_sharp_1_1_tree_algorithms_1_1_hash_based_prop_map_3_01_t_this_00_01_t_value_01_4.html#a5b34d571e076eed81412e62e6485c30d">SystemSharp.TreeAlgorithms.HashBasedPropMap&lt; TThis, TValue &gt;.HashBasedPropMap</a></div><div class="ttdeci">HashBasedPropMap()</div><div class="ttdoc">Constructs a new instance. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l00247">TreeAlgorithms.cs:247</a></div></div>
<div class="ttc" id="class_system_sharp_1_1_set_algorithms_1_1_union_find_3_01_t_01_4_html"><div class="ttname"><a href="class_system_sharp_1_1_set_algorithms_1_1_union_find_3_01_t_01_4.html">SystemSharp.SetAlgorithms.UnionFind&lt; T &gt;</a></div><div class="ttdoc">An implementation of the union-find data structure. </div><div class="ttdef"><b>Definition:</b> <a href="_set_algorithms_8cs_source.html#l00046">SetAlgorithms.cs:46</a></div></div>
<div class="ttc" id="namespace_system_sharp_1_1_tree_algorithms_html_a42c198b43d26b1f8b998dd6ce93c8d34"><div class="ttname"><a href="namespace_system_sharp_1_1_tree_algorithms.html#a42c198b43d26b1f8b998dd6ce93c8d34">SystemSharp.TreeAlgorithms.ENodeType</a></div><div class="ttdeci">ENodeType</div><div class="ttdoc">Node types of Havlak&#39;s loop analysis algorithm. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l00065">TreeAlgorithms.cs:65</a></div></div>
<div class="ttc" id="namespace_system_sharp_1_1_tree_algorithms_html_a42c198b43d26b1f8b998dd6ce93c8d34ad644e0f4ad7080896d6c62fbc22af824"><div class="ttname"><a href="namespace_system_sharp_1_1_tree_algorithms.html#a42c198b43d26b1f8b998dd6ce93c8d34ad644e0f4ad7080896d6c62fbc22af824">SystemSharp.TreeAlgorithms.Irreducible</a></div></div>
<div class="ttc" id="class_system_sharp_1_1_tree_algorithms_1_1_prop_maps_html"><div class="ttname"><a href="class_system_sharp_1_1_tree_algorithms_1_1_prop_maps.html">SystemSharp.TreeAlgorithms.PropMaps</a></div><div class="ttdoc">This static class provides helper methods for creating property maps. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l00406">TreeAlgorithms.cs:406</a></div></div>
<div class="ttc" id="namespace_system_sharp_1_1_tree_algorithms_html_afaa417760d7b75df6364c21f071e1027"><div class="ttname"><a href="namespace_system_sharp_1_1_tree_algorithms.html#afaa417760d7b75df6364c21f071e1027">SystemSharp.TreeAlgorithms.SetterFunc&lt; TThis, TValue &gt;</a></div><div class="ttdeci">delegate void SetterFunc&lt; TThis, TValue &gt;(TThis elem, TValue value)</div></div>
<div class="ttc" id="namespace_system_sharp_1_1_tree_algorithms_html_a42c198b43d26b1f8b998dd6ce93c8d34a0a28d1583016cd76f295eb77a6301262"><div class="ttname"><a href="namespace_system_sharp_1_1_tree_algorithms.html#a42c198b43d26b1f8b998dd6ce93c8d34a0a28d1583016cd76f295eb77a6301262">SystemSharp.TreeAlgorithms.Nonheader</a></div></div>
<div class="ttc" id="namespace_system_sharp_1_1_tree_algorithms_html_a42c198b43d26b1f8b998dd6ce93c8d34aad6e7652b1bdfb38783486c2c3d5e806"><div class="ttname"><a href="namespace_system_sharp_1_1_tree_algorithms.html#a42c198b43d26b1f8b998dd6ce93c8d34aad6e7652b1bdfb38783486c2c3d5e806">SystemSharp.TreeAlgorithms.Self</a></div></div>
<div class="ttc" id="namespace_system_sharp_1_1_tree_algorithms_html_a42c198b43d26b1f8b998dd6ce93c8d34a746efcb480a9b538d33da5f0c9b0003a"><div class="ttname"><a href="namespace_system_sharp_1_1_tree_algorithms.html#a42c198b43d26b1f8b998dd6ce93c8d34a746efcb480a9b538d33da5f0c9b0003a">SystemSharp.TreeAlgorithms.Reducible</a></div></div>
<div class="ttc" id="namespace_system_sharp_1_1_tree_algorithms_html_a6a1436f9b943edaf1ab43d5a5df6d004"><div class="ttname"><a href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004">SystemSharp.TreeAlgorithms.EAccess</a></div><div class="ttdeci">EAccess</div><div class="ttdoc">Describes the access priviliges for property maps. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l00034">TreeAlgorithms.cs:34</a></div></div>
<div class="ttc" id="namespace_system_sharp_1_1_tree_algorithms_html_a6a1436f9b943edaf1ab43d5a5df6d004a131fb182a881796e7606ed6da27f1197"><div class="ttname"><a href="namespace_system_sharp_1_1_tree_algorithms.html#a6a1436f9b943edaf1ab43d5a5df6d004a131fb182a881796e7606ed6da27f1197">SystemSharp.TreeAlgorithms.ReadOnly</a></div></div>
<div class="ttc" id="class_system_sharp_1_1_tree_algorithms_1_1_array_backed_prop_map_3_01_t_key_00_01_t_value_01_4_html_abfcf1dfec4ce1d80a9f9aae6a1ca5b2c"><div class="ttname"><a href="class_system_sharp_1_1_tree_algorithms_1_1_array_backed_prop_map_3_01_t_key_00_01_t_value_01_4.html#abfcf1dfec4ce1d80a9f9aae6a1ca5b2c">SystemSharp.TreeAlgorithms.ArrayBackedPropMap&lt; TKey, TValue &gt;.ArrayBackedPropMap</a></div><div class="ttdeci">ArrayBackedPropMap(TValue[] back, Func&lt; TKey, int &gt; indexFunc, EAccess access=EAccess.ReadWrite)</div><div class="ttdoc">Constructs a new instance. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l00377">TreeAlgorithms.cs:377</a></div></div>
<div class="ttc" id="class_system_sharp_1_1_tree_algorithms_1_1_dijkstra_html"><div class="ttname"><a href="class_system_sharp_1_1_tree_algorithms_1_1_dijkstra.html">SystemSharp.TreeAlgorithms.Dijkstra</a></div><div class="ttdoc">This static class provides an implementation of Dijkstra&#39;s shortest path algorithm. </div><div class="ttdef"><b>Definition:</b> <a href="_tree_algorithms_8cs_source.html#l01150">TreeAlgorithms.cs:1150</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_bb5e995590685548b7e11478911ee7c3.html">SystemSharp-Google-SVN</a></li><li class="navelem"><a class="el" href="dir_8deefa4467a62b572b52d238d562b104.html">SystemSharp</a></li><li class="navelem"><a class="el" href="dir_0e5a72156f8560bbc472a395da2569d6.html">SystemSharp</a></li><li class="navelem"><a class="el" href="dir_9d3c30b4336bd92c64ccf0aeee487ace.html">SystemSharp</a></li><li class="navelem"><a class="el" href="dir_2049ebf5cdae221b0cb24be013d5f9a2.html">TreeAlgorithms</a></li><li class="navelem"><a class="el" href="_tree_algorithms_8cs.html">TreeAlgorithms.cs</a></li>
    <li class="footer">Generated on Thu Dec 26 2013 14:21:44 for SystemSharp by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.6 </li>
  </ul>
</div>
</body>
</html>
